./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23'] 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-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:53:09,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:53:09,267 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:53:09,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:53:09,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:53:09,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:53:09,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:53:09,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:53:09,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:53:09,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:53:09,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:53:09,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:53:09,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:53:09,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:53:09,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:53:09,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:53:09,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:53:09,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:09,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:53:09,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:53:09,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:53:09,313 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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2024-11-07 04:53:09,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:53:09,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:53:09,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:53:09,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:53:09,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:53:09,628 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-29.i [2024-11-07 04:53:10,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:53:11,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:53:11,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-11-07 04:53:11,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53c1000d/25c1648a51114f21ba7eb52c467f09e4/FLAG76e7cd72e [2024-11-07 04:53:11,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53c1000d/25c1648a51114f21ba7eb52c467f09e4 [2024-11-07 04:53:11,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:53:11,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:53:11,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:11,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:53:11,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:53:11,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7f1f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11, skipping insertion in model container [2024-11-07 04:53:11,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:53:11,457 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-29.i[915,928] [2024-11-07 04:53:11,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:11,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:53:11,562 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-29.i[915,928] [2024-11-07 04:53:11,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:11,608 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:53:11,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11 WrapperNode [2024-11-07 04:53:11,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:11,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:11,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:53:11,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:53:11,618 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:53:11" (1/1) ... [2024-11-07 04:53:11,626 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:53:11" (1/1) ... [2024-11-07 04:53:11,662 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-07 04:53:11,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:11,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:53:11,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:53:11,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:53:11,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,695 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:53:11,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:53:11,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:53:11,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:53:11,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:53:11,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (1/1) ... [2024-11-07 04:53:11,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:11,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:11,752 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:53:11,758 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:53:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:53:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:53:11,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:53:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:53:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:53:11,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:53:11,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:53:11,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:53:12,290 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:53:12,290 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:53:12,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:53:12,300 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:53:12,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:12 BoogieIcfgContainer [2024-11-07 04:53:12,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:53:12,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:53:12,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:53:12,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:53:12,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:53:11" (1/3) ... [2024-11-07 04:53:12,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cc15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:12, skipping insertion in model container [2024-11-07 04:53:12,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:11" (2/3) ... [2024-11-07 04:53:12,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520cc15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:12, skipping insertion in model container [2024-11-07 04:53:12,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:12" (3/3) ... [2024-11-07 04:53:12,310 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-11-07 04:53:12,325 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:53:12,327 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:53:12,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:53:12,402 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;@2941e196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:53:12,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:53:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:53:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:12,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:12,419 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:12,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1626801051, now seen corresponding path program 1 times [2024-11-07 04:53:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821538049] [2024-11-07 04:53:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:53:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:53:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:53:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:53:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:53:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:53:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:53:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:53:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:53:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:53:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:53:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:53:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:53:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:53:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:53:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:53:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:53:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:53:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:53:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:53:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:53:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:53:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:53:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:53:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:53:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:53:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:53:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:53:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:53:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:53:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:53:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 04:53:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:53:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 04:53:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 04:53:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 04:53:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-07 04:53:13,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:13,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821538049] [2024-11-07 04:53:13,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821538049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:13,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:53:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832343217] [2024-11-07 04:53:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:53:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:53:13,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:53:13,075 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 04:53:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:13,103 INFO L93 Difference]: Finished difference Result 177 states and 323 transitions. [2024-11-07 04:53:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:53:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 233 [2024-11-07 04:53:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:13,112 INFO L225 Difference]: With dead ends: 177 [2024-11-07 04:53:13,112 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 04:53:13,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:53:13,117 INFO L432 NwaCegarLoop]: 138 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, 138 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:53:13,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:53:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 04:53:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 04:53:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:53:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2024-11-07 04:53:13,162 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 233 [2024-11-07 04:53:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:13,162 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2024-11-07 04:53:13,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 04:53:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2024-11-07 04:53:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:13,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:13,167 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:53:13,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -302374879, now seen corresponding path program 1 times [2024-11-07 04:53:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349237028] [2024-11-07 04:53:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:53:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:53:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:53:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:53:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:53:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:53:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:53:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:53:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:53:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:53:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:53:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:53:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:53:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:53:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:53:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:53:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:53:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:53:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:53:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:53:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:53:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:53:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:53:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:53:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:53:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:53:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:53:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:53:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:53:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:53:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:53:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 04:53:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:53:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 04:53:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 04:53:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 04:53:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-07 04:53:13,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349237028] [2024-11-07 04:53:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349237028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:13,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:13,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:53:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098024668] [2024-11-07 04:53:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:53:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:53:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:53:13,979 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:14,041 INFO L93 Difference]: Finished difference Result 258 states and 408 transitions. [2024-11-07 04:53:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:53:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2024-11-07 04:53:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:14,049 INFO L225 Difference]: With dead ends: 258 [2024-11-07 04:53:14,050 INFO L226 Difference]: Without dead ends: 173 [2024-11-07 04:53:14,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:53:14,053 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:14,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:53:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-07 04:53:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2024-11-07 04:53:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 04:53:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2024-11-07 04:53:14,105 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 233 [2024-11-07 04:53:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:14,106 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2024-11-07 04:53:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2024-11-07 04:53:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:14,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:14,113 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:14,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:53:14,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:14,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:14,117 INFO L85 PathProgramCache]: Analyzing trace with hash -245116577, now seen corresponding path program 1 times [2024-11-07 04:53:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:14,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185204327] [2024-11-07 04:53:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:53:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:53:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:53:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:53:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:53:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:53:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:53:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:53:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:53:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:53:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:53:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:53:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:53:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:53:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:53:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:53:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:53:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:53:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:53:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:53:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:53:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:53:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:53:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:53:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:53:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 04:53:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 04:53:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:53:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:53:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 04:53:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 04:53:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 04:53:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-07 04:53:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 04:53:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-07 04:53:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 04:53:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-07 04:53:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185204327] [2024-11-07 04:53:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185204327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:53:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203060808] [2024-11-07 04:53:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:14,822 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:53:14,824 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:53:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:15,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 04:53:15,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1952 proven. 45 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2024-11-07 04:53:15,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-07 04:53:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203060808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:53:16,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:53:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-07 04:53:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580837099] [2024-11-07 04:53:16,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:53:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:53:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:53:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:53:16,093 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) [2024-11-07 04:53:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:16,515 INFO L93 Difference]: Finished difference Result 351 states and 549 transitions. [2024-11-07 04:53:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 04:53:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) Word has length 233 [2024-11-07 04:53:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:16,522 INFO L225 Difference]: With dead ends: 351 [2024-11-07 04:53:16,524 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 04:53:16,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-07 04:53:16,527 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 141 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:16,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 236 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:53:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 04:53:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-07 04:53:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 04:53:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2024-11-07 04:53:16,579 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 233 [2024-11-07 04:53:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2024-11-07 04:53:16,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 7 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 7 states have call successors, (101) [2024-11-07 04:53:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2024-11-07 04:53:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 04:53:16,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:16,583 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:16,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:53:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:16,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:16,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2078305760, now seen corresponding path program 1 times [2024-11-07 04:53:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235119336] [2024-11-07 04:53:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:53:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735951830] [2024-11-07 04:53:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:17,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:17,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:17,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:53:17,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:53:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:53:17,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:53:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:53:17,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:53:17,450 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:53:17,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:53:17,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:53:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:17,659 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 04:53:17,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:53:17,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:53:17 BoogieIcfgContainer [2024-11-07 04:53:17,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:53:17,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:53:17,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:53:17,888 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:53:17,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:12" (3/4) ... [2024-11-07 04:53:17,891 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:53:17,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:53:17,893 INFO L158 Benchmark]: Toolchain (without parser) took 6614.83ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.1MB in the beginning and 85.1MB in the end (delta: -9.0MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-07 04:53:17,893 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:17,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.09ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 61.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:53:17,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 59.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:17,894 INFO L158 Benchmark]: Boogie Preprocessor took 47.36ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:17,896 INFO L158 Benchmark]: RCFGBuilder took 588.56ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 73.7MB in the end (delta: -17.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-07 04:53:17,897 INFO L158 Benchmark]: TraceAbstraction took 5584.91ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 72.8MB in the beginning and 85.1MB in the end (delta: -12.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-11-07 04:53:17,897 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 85.1MB in the end (delta: 17.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:17,898 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.77ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.09ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 61.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 59.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.36ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 588.56ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 73.7MB in the end (delta: -17.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5584.91ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 72.8MB in the beginning and 85.1MB in the end (delta: -12.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 85.1MB in the end (delta: 17.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] double var_1_30 = 64.25; [L46] signed short int var_1_31 = 10; [L47] signed short int var_1_32 = 0; [L48] signed short int var_1_33 = 8; [L49] unsigned char var_1_34 = 1; [L50] unsigned char var_1_35 = 0; [L51] unsigned short int var_1_36 = 5; [L52] signed long int var_1_37 = -1; [L53] signed long int var_1_38 = 5; [L54] unsigned short int var_1_39 = 100; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] FCALL updateLastVariables() [L180] CALL updateVariables() [L108] var_1_6 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] var_1_7 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L115] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L117] var_1_10 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L119] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L119] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L120] var_1_12 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L121] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L122] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L122] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L123] var_1_13 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L124] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L125] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L125] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L126] var_1_14 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L127] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L128] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L128] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L129] var_1_15 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L131] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L131] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L132] var_1_16 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L134] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L134] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L135] var_1_17 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L137] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L137] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L138] var_1_19 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L139] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L140] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L140] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L141] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L141] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L142] var_1_22 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L143] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L144] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L144] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L145] var_1_24 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L146] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L147] var_1_25 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L148] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L149] var_1_26 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L150] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L151] var_1_30 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L152] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L153] var_1_32 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_32 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L154] RET assume_abort_if_not(var_1_32 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L155] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L155] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L156] var_1_35 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L157] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L158] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L158] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L159] var_1_37 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_37 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L160] RET assume_abort_if_not(var_1_37 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L161] CALL assume_abort_if_not(var_1_37 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L161] RET assume_abort_if_not(var_1_37 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L162] var_1_38 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L163] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L164] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L164] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L165] var_1_39 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L166] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L167] CALL assume_abort_if_not(var_1_39 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L167] RET assume_abort_if_not(var_1_39 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L180] RET updateVariables() [L181] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_32 [L61] var_1_34 = var_1_35 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L62] COND FALSE !((var_1_37 - var_1_38) <= var_1_31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L67] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L68] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L69] COND FALSE !(var_1_10 <= var_1_17) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L75] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L76] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L78] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L83] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L84] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=0, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L88] COND FALSE !(\read(var_1_18)) [L91] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L93] COND TRUE \read(var_1_1) [L94] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=-63, var_1_13=63, var_1_14=63, var_1_15=63, var_1_16=63, var_1_17=0, var_1_18=0, var_1_19=64, var_1_1=1, var_1_20=16255, var_1_22=16382, var_1_23=158/5, var_1_27=63, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=0, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 641 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 363 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1400 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2435 SizeOfPredicates, 3 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 14685/14820 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:53:17,938 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-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:53:20,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:53:20,578 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:53:20,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:53:20,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:53:20,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:53:20,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:53:20,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:53:20,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:53:20,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:53:20,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:53:20,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:53:20,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:53:20,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:53:20,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:53:20,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:53:20,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:20,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:53:20,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:53:20,634 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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2024-11-07 04:53:20,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:53:20,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:53:20,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:53:20,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:53:20,967 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:53:20,968 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-29.i [2024-11-07 04:53:22,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:53:22,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:53:22,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-11-07 04:53:22,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3551139e2/541be3e5da264b528cc1380f19ac86f6/FLAG8298d9193 [2024-11-07 04:53:22,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3551139e2/541be3e5da264b528cc1380f19ac86f6 [2024-11-07 04:53:22,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:53:22,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:53:22,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:22,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:53:22,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:53:22,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:22,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae48501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22, skipping insertion in model container [2024-11-07 04:53:22,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:22,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:53:22,820 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-29.i[915,928] [2024-11-07 04:53:22,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:22,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:53:22,940 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-29.i[915,928] [2024-11-07 04:53:22,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:22,995 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:53:22,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22 WrapperNode [2024-11-07 04:53:22,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:22,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:22,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:53:22,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:53:23,007 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:53:22" (1/1) ... [2024-11-07 04:53:23,024 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:53:22" (1/1) ... [2024-11-07 04:53:23,067 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 04:53:23,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:23,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:53:23,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:53:23,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:53:23,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,105 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:53:23,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:53:23,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:53:23,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:53:23,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:53:23,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (1/1) ... [2024-11-07 04:53:23,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:23,177 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:53:23,184 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:53:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:53:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:53:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:53:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:53:23,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:53:23,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:53:25,376 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:53:25,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:53:25,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:53:25,388 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:53:25,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:25 BoogieIcfgContainer [2024-11-07 04:53:25,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:53:25,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:53:25,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:53:25,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:53:25,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:53:22" (1/3) ... [2024-11-07 04:53:25,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b72b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:25, skipping insertion in model container [2024-11-07 04:53:25,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:22" (2/3) ... [2024-11-07 04:53:25,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b72b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:25, skipping insertion in model container [2024-11-07 04:53:25,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:25" (3/3) ... [2024-11-07 04:53:25,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2024-11-07 04:53:25,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:53:25,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:53:25,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:53:25,489 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;@ebbe1a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:53:25,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:53:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:53:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:25,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:25,513 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1626801051, now seen corresponding path program 1 times [2024-11-07 04:53:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703507807] [2024-11-07 04:53:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:25,536 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:53:25,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:25,539 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:53:25,540 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:53:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:25,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:53:25,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2024-11-07 04:53:26,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:53:26,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:53:26,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703507807] [2024-11-07 04:53:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703507807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:53:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157353320] [2024-11-07 04:53:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:26,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:53:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:53:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:53:26,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:53:26,082 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) 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, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 04:53:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:26,110 INFO L93 Difference]: Finished difference Result 177 states and 323 transitions. [2024-11-07 04:53:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:53:26,112 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, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 233 [2024-11-07 04:53:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:26,119 INFO L225 Difference]: With dead ends: 177 [2024-11-07 04:53:26,120 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 04:53:26,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 232 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:53:26,126 INFO L432 NwaCegarLoop]: 138 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, 138 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:53:26,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:53:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 04:53:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 04:53:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:53:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2024-11-07 04:53:26,180 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 233 [2024-11-07 04:53:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:26,180 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2024-11-07 04:53:26,181 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, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 04:53:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2024-11-07 04:53:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:26,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:26,187 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:26,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:53:26,391 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:53:26,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash -302374879, now seen corresponding path program 1 times [2024-11-07 04:53:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270312139] [2024-11-07 04:53:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:26,406 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:53:26,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:26,409 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:53:26,412 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:53:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:53:26,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-11-07 04:53:27,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:27,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:53:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270312139] [2024-11-07 04:53:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270312139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:53:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [319764631] [2024-11-07 04:53:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:53:27,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:53:27,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 04:53:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:28,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:53:28,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-07 04:53:29,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:53:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [319764631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:53:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 04:53:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873201446] [2024-11-07 04:53:29,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:29,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:53:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:53:29,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:53:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:53:29,227 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:30,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:53:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:30,833 INFO L93 Difference]: Finished difference Result 258 states and 408 transitions. [2024-11-07 04:53:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:53:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2024-11-07 04:53:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:30,857 INFO L225 Difference]: With dead ends: 258 [2024-11-07 04:53:30,858 INFO L226 Difference]: Without dead ends: 173 [2024-11-07 04:53:30,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:53:30,859 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 23 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:30,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 04:53:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-07 04:53:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2024-11-07 04:53:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-07 04:53:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2024-11-07 04:53:30,905 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 233 [2024-11-07 04:53:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2024-11-07 04:53:30,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2024-11-07 04:53:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:30,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:30,910 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 04:53:31,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-07 04:53:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:31,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:31,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -245116577, now seen corresponding path program 1 times [2024-11-07 04:53:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808101588] [2024-11-07 04:53:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:31,312 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:53:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:31,316 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:53:31,317 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:53:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:31,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:53:31,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-11-07 04:53:32,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:32,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:53:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808101588] [2024-11-07 04:53:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808101588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:53:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806576238] [2024-11-07 04:53:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:32,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:53:32,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:53:32,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 04:53:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:33,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:53:33,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-07 04:53:33,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:53:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [806576238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:33,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:53:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-07 04:53:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379093470] [2024-11-07 04:53:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:53:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:53:33,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:53:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:53:33,323 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:35,813 INFO L93 Difference]: Finished difference Result 505 states and 803 transitions. [2024-11-07 04:53:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:53:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2024-11-07 04:53:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:35,819 INFO L225 Difference]: With dead ends: 505 [2024-11-07 04:53:35,819 INFO L226 Difference]: Without dead ends: 337 [2024-11-07 04:53:35,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:53:35,821 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 128 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:35,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 04:53:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-07 04:53:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-07 04:53:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 174 states have (on average 1.2528735632183907) internal successors, (218), 174 states have internal predecessors, (218), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-07 04:53:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 530 transitions. [2024-11-07 04:53:35,876 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 530 transitions. Word has length 233 [2024-11-07 04:53:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:35,877 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 530 transitions. [2024-11-07 04:53:35,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-07 04:53:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 530 transitions. [2024-11-07 04:53:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 04:53:35,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:35,892 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 04:53:36,106 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:53:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:53:36,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1529890785, now seen corresponding path program 1 times [2024-11-07 04:53:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:36,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220131014] [2024-11-07 04:53:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:36,295 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:53:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:36,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:53:36,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 04:53:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:36,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:53:36,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2024-11-07 04:53:37,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:37,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:53:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220131014] [2024-11-07 04:53:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220131014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:53:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483306228] [2024-11-07 04:53:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:37,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:53:37,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:53:37,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 04:53:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:38,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:53:38,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1338 proven. 36 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2024-11-07 04:53:41,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-07 04:53:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483306228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:53:42,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:53:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-07 04:53:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990806065] [2024-11-07 04:53:42,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:53:42,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:53:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:53:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:53:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:53:42,118 INFO L87 Difference]: Start difference. First operand 335 states and 530 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2024-11-07 04:53:52,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 04:53:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:58,496 INFO L93 Difference]: Finished difference Result 901 states and 1382 transitions. [2024-11-07 04:53:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 04:53:58,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 233 [2024-11-07 04:53:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:58,506 INFO L225 Difference]: With dead ends: 901 [2024-11-07 04:53:58,507 INFO L226 Difference]: Without dead ends: 569 [2024-11-07 04:53:58,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 04:53:58,509 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 401 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:58,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 349 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2024-11-07 04:53:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-07 04:53:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 371. [2024-11-07 04:53:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 202 states have (on average 1.2079207920792079) internal successors, (244), 202 states have internal predecessors, (244), 156 states have call successors, (156), 12 states have call predecessors, (156), 12 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-07 04:53:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 556 transitions. [2024-11-07 04:53:58,602 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 556 transitions. Word has length 233 [2024-11-07 04:53:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:58,603 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 556 transitions. [2024-11-07 04:53:58,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2024-11-07 04:53:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 556 transitions. [2024-11-07 04:53:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 04:53:58,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:58,610 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 04:53:58,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 04:53:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:59,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -48627164, now seen corresponding path program 1 times [2024-11-07 04:53:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256675811] [2024-11-07 04:53:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:59,012 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:53:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:59,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:53:59,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 04:53:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:59,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 04:53:59,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:21,134 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-07 04:54:29,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-07 04:54:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1420 proven. 99 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-11-07 04:54:35,015 INFO L311 TraceCheckSpWp]: Computing backward predicates...