./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.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_fillercodesize_ps-cn-10_file-35.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', '565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426'] 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_fillercodesize_ps-cn-10_file-35.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 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:54:02,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:54:02,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:54:02,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:54:02,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:54:02,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:54:02,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:54:02,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:54:02,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:54:02,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:54:02,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:54:02,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:54:02,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:54:02,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:54:02,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:54:02,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:54:02,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:54:02,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:54:02,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:54:02,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:54:02,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:54:02,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:54:02,453 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 -> 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 [2024-11-07 04:54:02,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:54:02,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:54:02,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:54:02,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:54:02,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:54:02,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:04,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:54:04,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:54:04,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:04,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/347dcb92a/107c35475d4c4a8a9b98435151554068/FLAG9ffaf0093 [2024-11-07 04:54:04,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/347dcb92a/107c35475d4c4a8a9b98435151554068 [2024-11-07 04:54:04,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:54:04,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:54:04,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:54:04,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:54:04,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:54:04,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:04,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160a0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04, skipping insertion in model container [2024-11-07 04:54:04,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:04,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:54:04,801 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_fillercodesize_ps-cn-10_file-35.i[915,928] [2024-11-07 04:54:04,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:54:04,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:54:04,893 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_fillercodesize_ps-cn-10_file-35.i[915,928] [2024-11-07 04:54:04,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:54:04,937 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:54:04,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04 WrapperNode [2024-11-07 04:54:04,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:54:04,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:54:04,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:54:04,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:54:04,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:04,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:04,991 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-07 04:54:04,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:54:04,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:54:04,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:54:04,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:54:05,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,026 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 04:54:05,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:54:05,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:54:05,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:54:05,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:54:05,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (1/1) ... [2024-11-07 04:54:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:54:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:54:05,069 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 04:54:05,071 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 04:54:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:54:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:54:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:54:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:54:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:54:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:54:05,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:54:05,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:54:05,425 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 04:54:05,425 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:54:05,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:54:05,435 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:54:05,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:05 BoogieIcfgContainer [2024-11-07 04:54:05,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:54:05,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:54:05,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:54:05,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:54:05,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:54:04" (1/3) ... [2024-11-07 04:54:05,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e43c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:05, skipping insertion in model container [2024-11-07 04:54:05,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:04" (2/3) ... [2024-11-07 04:54:05,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e43c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:05, skipping insertion in model container [2024-11-07 04:54:05,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:05" (3/3) ... [2024-11-07 04:54:05,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:05,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:54:05,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:54:05,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:54:05,540 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;@3c1bae58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:54:05,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:54:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:54:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:54:05,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:05,556 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:05,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash -676710168, now seen corresponding path program 1 times [2024-11-07 04:54:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:54:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632661168] [2024-11-07 04:54:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:54:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:54:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:54:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:54:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:54:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:54:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:54:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:54:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:54:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:54:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:54:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:54:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:54:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:54:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:54:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:54:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 04:54:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:54:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 04:54:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:54:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 04:54:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 04:54:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 04:54:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 04:54:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 04:54:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 04:54:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:54:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632661168] [2024-11-07 04:54:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632661168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:05,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:54:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795604298] [2024-11-07 04:54:05,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:05,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:54:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:54:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:54:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:54:05,913 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:54:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:05,947 INFO L93 Difference]: Finished difference Result 163 states and 273 transitions. [2024-11-07 04:54:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:54:05,948 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-07 04:54:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:05,952 INFO L225 Difference]: With dead ends: 163 [2024-11-07 04:54:05,952 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 04:54:05,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 04:54:05,956 INFO L432 NwaCegarLoop]: 120 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, 120 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 04:54:05,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:54:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 04:54:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 04:54:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:54:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2024-11-07 04:54:05,992 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 167 [2024-11-07 04:54:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:05,993 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2024-11-07 04:54:05,994 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:54:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2024-11-07 04:54:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 04:54:06,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:06,000 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:06,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:54:06,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 156436578, now seen corresponding path program 1 times [2024-11-07 04:54:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:54:06,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641169077] [2024-11-07 04:54:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:54:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:54:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:54:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:54:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:54:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:54:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:54:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:54:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:54:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:54:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:54:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:54:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:54:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:54:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:54:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:54:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 04:54:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:54:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 04:54:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:54:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 04:54:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 04:54:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 04:54:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 04:54:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 04:54:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 04:54:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:06,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:54:06,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641169077] [2024-11-07 04:54:06,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641169077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:06,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:06,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:54:06,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807779510] [2024-11-07 04:54:06,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:54:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:54:06,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:54:06,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:54:06,643 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:06,870 INFO L93 Difference]: Finished difference Result 257 states and 381 transitions. [2024-11-07 04:54:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:54:06,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 04:54:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:06,874 INFO L225 Difference]: With dead ends: 257 [2024-11-07 04:54:06,874 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 04:54:06,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:54:06,875 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 109 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:06,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 442 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:54:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 04:54:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157. [2024-11-07 04:54:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:54:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2024-11-07 04:54:06,912 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 167 [2024-11-07 04:54:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:06,912 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2024-11-07 04:54:06,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2024-11-07 04:54:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 04:54:06,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:06,914 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:06,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:54:06,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:06,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1751684857, now seen corresponding path program 1 times [2024-11-07 04:54:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:54:06,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437615172] [2024-11-07 04:54:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:54:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:54:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:54:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:54:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:54:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:54:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:54:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:54:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:54:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:54:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:54:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:54:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:54:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:54:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:54:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:54:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 04:54:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:54:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 04:54:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:54:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 04:54:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 04:54:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 04:54:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 04:54:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 04:54:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 04:54:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:07,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:54:07,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437615172] [2024-11-07 04:54:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437615172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:54:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142911744] [2024-11-07 04:54:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:07,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:54:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:54:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:54:07,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:54:07,248 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:07,368 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2024-11-07 04:54:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:54:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-07 04:54:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:07,372 INFO L225 Difference]: With dead ends: 309 [2024-11-07 04:54:07,374 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 04:54:07,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:54:07,375 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 52 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:07,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 285 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:54:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 04:54:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2024-11-07 04:54:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 158 states have (on average 1.2974683544303798) internal successors, (205), 160 states have internal predecessors, (205), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 04:54:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 333 transitions. [2024-11-07 04:54:07,409 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 333 transitions. Word has length 168 [2024-11-07 04:54:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:07,409 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 333 transitions. [2024-11-07 04:54:07,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 333 transitions. [2024-11-07 04:54:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 04:54:07,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:07,411 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:07,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:54:07,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:07,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1164878843, now seen corresponding path program 1 times [2024-11-07 04:54:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:54:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115157670] [2024-11-07 04:54:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:54:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:54:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858795527] [2024-11-07 04:54:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:54:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:54:07,493 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 04:54:07,501 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 04:54:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:54:07,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:54:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:54:07,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:54:07,783 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:54:07,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:54:07,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:54:07,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:54:07,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 04:54:08,082 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:54:08,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:54:08 BoogieIcfgContainer [2024-11-07 04:54:08,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:54:08,087 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:54:08,087 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:54:08,087 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:54:08,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:05" (3/4) ... [2024-11-07 04:54:08,089 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:54:08,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:54:08,091 INFO L158 Benchmark]: Toolchain (without parser) took 3420.09ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 93.3MB in the beginning and 114.8MB in the end (delta: -21.5MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-11-07 04:54:08,091 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:54:08,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.36ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 78.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:54:08,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 75.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:54:08,092 INFO L158 Benchmark]: Boogie Preprocessor took 48.32ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:54:08,092 INFO L158 Benchmark]: RCFGBuilder took 391.02ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 50.4MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 04:54:08,092 INFO L158 Benchmark]: TraceAbstraction took 2649.18ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 49.8MB in the beginning and 114.8MB in the end (delta: -65.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:54:08,092 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 114.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:54:08,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.36ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 78.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 75.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.32ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 391.02ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 50.4MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2649.18ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 49.8MB in the beginning and 114.8MB in the end (delta: -65.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 114.8MB in the end (delta: 45.1kB). 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 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someUnaryFLOAToperation at line 96, overapproximation of someBinaryArithmeticFLOAToperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed long int var_1_29 = -128; [L47] signed char var_1_30 = -25; [L48] unsigned char var_1_31 = 0; [L49] unsigned char var_1_32 = 1; [L50] unsigned char var_1_33 = 1; [L51] signed short int var_1_34 = 0; [L52] signed short int last_1_var_1_12 = 2; [L53] signed long int last_1_var_1_13 = -256; [L54] double last_1_var_1_14 = 127.75; [L55] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L152] last_1_var_1_12 = var_1_12 [L153] last_1_var_1_13 = var_1_13 [L154] last_1_var_1_14 = var_1_14 [L155] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L109] var_1_3 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L110] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L111] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L111] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L112] var_1_4 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L113] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L114] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L114] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L115] var_1_5 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L116] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L117] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L117] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L118] var_1_9 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L119] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L120] var_1_11 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L121] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L122] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L122] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L123] var_1_15 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L124] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L125] var_1_17 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L126] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L127] var_1_18 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L128] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L129] var_1_19 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L130] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L131] var_1_20 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L132] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L133] var_1_22 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L134] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L136] var_1_24 = __VERIFIER_nondet_short() [L137] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L137] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L139] var_1_25 = __VERIFIER_nondet_short() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L142] var_1_27 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L143] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L144] var_1_29 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L145] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] CALL assume_abort_if_not(var_1_29 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] RET assume_abort_if_not(var_1_29 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L147] var_1_32 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET updateVariables() [L167] CALL step() [L59] var_1_26 = var_1_27 [L60] var_1_28 = var_1_29 [L61] var_1_30 = 0 [L62] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L63] EXPR var_1_29 | ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L63] COND TRUE (var_1_29 | ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) >= var_1_28 [L64] var_1_33 = var_1_32 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L66] var_1_34 = var_1_30 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L67] COND FALSE !(\read(last_1_var_1_21)) [L70] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L72] COND TRUE var_1_18 > var_1_9 [L73] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L77] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L78] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L79] COND FALSE !((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) [L82] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L87] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L88] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L91] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L91] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L92] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L96] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L97] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L98] COND TRUE stepLocal_3 == var_1_6 [L99] var_1_21 = ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L101] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L102] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L158-L159] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=1, var_1_22=1, var_1_23=-256, var_1_24=0, var_1_25=256, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 847 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 485 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 362 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3600/3600 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 04:54:08,120 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_fillercodesize_ps-cn-10_file-35.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 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:54:10,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:54:10,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:54:10,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:54:10,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:54:10,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:54:10,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:54:10,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:54:10,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:54:10,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:54:10,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:54:10,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:54:10,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:54:10,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:54:10,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:54:10,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:54:10,172 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 -> 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 [2024-11-07 04:54:10,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:54:10,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:54:10,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:54:10,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:54:10,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:54:10,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:11,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:54:12,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:54:12,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:12,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1cf009a6/002989a1460c4826b5346f0372e5573c/FLAGcffe31a4c [2024-11-07 04:54:12,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1cf009a6/002989a1460c4826b5346f0372e5573c [2024-11-07 04:54:12,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:54:12,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:54:12,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:54:12,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:54:12,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:54:12,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6254f149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12, skipping insertion in model container [2024-11-07 04:54:12,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:54:12,188 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_fillercodesize_ps-cn-10_file-35.i[915,928] [2024-11-07 04:54:12,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:54:12,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:54:12,277 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_fillercodesize_ps-cn-10_file-35.i[915,928] [2024-11-07 04:54:12,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:54:12,330 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:54:12,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12 WrapperNode [2024-11-07 04:54:12,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:54:12,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:54:12,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:54:12,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:54:12,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,377 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-07 04:54:12,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:54:12,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:54:12,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:54:12,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:54:12,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,410 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 04:54:12,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:54:12,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:54:12,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:54:12,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:54:12,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (1/1) ... [2024-11-07 04:54:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:54:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:54:12,476 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 04:54:12,481 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 04:54:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:54:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:54:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:54:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:54:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:54:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:54:12,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:54:12,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:54:14,402 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:54:14,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:54:14,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:54:14,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:54:14,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:14 BoogieIcfgContainer [2024-11-07 04:54:14,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:54:14,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:54:14,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:54:14,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:54:14,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:54:12" (1/3) ... [2024-11-07 04:54:14,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5667c732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:14, skipping insertion in model container [2024-11-07 04:54:14,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:12" (2/3) ... [2024-11-07 04:54:14,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5667c732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:14, skipping insertion in model container [2024-11-07 04:54:14,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:14" (3/3) ... [2024-11-07 04:54:14,423 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2024-11-07 04:54:14,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:54:14,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:54:14,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:54:14,484 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;@4b9a5f78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:54:14,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:54:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:54:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 04:54:14,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:14,500 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:14,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:14,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -635031981, now seen corresponding path program 1 times [2024-11-07 04:54:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442903160] [2024-11-07 04:54:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:14,516 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 04:54:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:14,518 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 04:54:14,522 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 04:54:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:14,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:54:14,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-11-07 04:54:14,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:54:14,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442903160] [2024-11-07 04:54:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442903160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:54:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149445011] [2024-11-07 04:54:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:54:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:54:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:54:14,943 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:54:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:14,958 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2024-11-07 04:54:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:54:14,959 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2024-11-07 04:54:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:14,963 INFO L225 Difference]: With dead ends: 143 [2024-11-07 04:54:14,963 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 04:54:14,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 04:54:14,966 INFO L432 NwaCegarLoop]: 105 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, 105 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 04:54:14,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:54:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 04:54:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 04:54:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:54:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-11-07 04:54:14,991 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 163 [2024-11-07 04:54:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:14,991 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-11-07 04:54:14,991 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 04:54:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-11-07 04:54:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 04:54:14,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:14,993 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:15,009 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 04:54:15,194 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 04:54:15,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1773810995, now seen corresponding path program 1 times [2024-11-07 04:54:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:15,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076977132] [2024-11-07 04:54:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:15,196 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 04:54:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:15,201 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 04:54:15,203 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 04:54:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:15,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:54:15,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:16,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:54:16,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076977132] [2024-11-07 04:54:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076977132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:54:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589942635] [2024-11-07 04:54:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:54:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:16,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:54:16,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:54:16,059 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:17,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:18,617 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2024-11-07 04:54:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:54:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2024-11-07 04:54:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:18,633 INFO L225 Difference]: With dead ends: 226 [2024-11-07 04:54:18,633 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 04:54:18,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:54:18,638 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:18,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 323 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 04:54:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 04:54:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2024-11-07 04:54:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 04:54:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2024-11-07 04:54:18,661 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 163 [2024-11-07 04:54:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2024-11-07 04:54:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2024-11-07 04:54:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 04:54:18,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:18,666 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:18,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 04:54:18,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:54:18,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:18,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1241292623, now seen corresponding path program 1 times [2024-11-07 04:54:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982085093] [2024-11-07 04:54:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:18,868 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 04:54:18,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:18,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:54:18,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 04:54:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:19,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:54:19,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:19,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:54:19,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:19,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982085093] [2024-11-07 04:54:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982085093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:19,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:19,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:54:19,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246320405] [2024-11-07 04:54:19,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:19,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:54:19,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:54:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:54:19,481 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:22,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:22,326 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2024-11-07 04:54:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:54:22,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2024-11-07 04:54:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:22,344 INFO L225 Difference]: With dead ends: 429 [2024-11-07 04:54:22,344 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 04:54:22,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:54:22,346 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:22,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 364 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 04:54:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 04:54:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 269. [2024-11-07 04:54:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 164 states have internal predecessors, (204), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-07 04:54:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 404 transitions. [2024-11-07 04:54:22,408 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 404 transitions. Word has length 163 [2024-11-07 04:54:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:22,408 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 404 transitions. [2024-11-07 04:54:22,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 404 transitions. [2024-11-07 04:54:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:54:22,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:22,410 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:22,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 04:54:22,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:54:22,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:22,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1678520506, now seen corresponding path program 1 times [2024-11-07 04:54:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866800548] [2024-11-07 04:54:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:22,612 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 04:54:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:22,614 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 04:54:22,615 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 04:54:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:22,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 04:54:22,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 04:54:22,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:54:22,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866800548] [2024-11-07 04:54:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866800548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:54:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503653920] [2024-11-07 04:54:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:22,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:54:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:54:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:54:22,987 INFO L87 Difference]: Start difference. First operand 269 states and 404 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:25,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:27,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:28,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:29,338 INFO L93 Difference]: Finished difference Result 659 states and 984 transitions. [2024-11-07 04:54:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:54:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-07 04:54:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:29,352 INFO L225 Difference]: With dead ends: 659 [2024-11-07 04:54:29,353 INFO L226 Difference]: Without dead ends: 591 [2024-11-07 04:54:29,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:54:29,354 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 134 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:29,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 617 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-07 04:54:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-07 04:54:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 329. [2024-11-07 04:54:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 208 states have (on average 1.25) internal successors, (260), 210 states have internal predecessors, (260), 114 states have call successors, (114), 6 states have call predecessors, (114), 6 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-07 04:54:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 488 transitions. [2024-11-07 04:54:29,406 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 488 transitions. Word has length 164 [2024-11-07 04:54:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:29,406 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 488 transitions. [2024-11-07 04:54:29,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 04:54:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 488 transitions. [2024-11-07 04:54:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 04:54:29,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:29,408 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:29,422 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 04:54:29,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:54:29,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash -841439428, now seen corresponding path program 1 times [2024-11-07 04:54:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815667198] [2024-11-07 04:54:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:29,611 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 04:54:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:29,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:54:29,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 04:54:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:30,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 04:54:30,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...