./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.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-25_file-38.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', 'c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f']
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-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 05:15:19,349 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 05:15:19,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 05:15:19,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 05:15:19,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 05:15:19,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 05:15:19,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 05:15:19,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 05:15:19,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 05:15:19,488 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 05:15:19,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 05:15:19,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 05:15:19,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 05:15:19,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 05:15:19,489 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 05:15:19,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 05:15:19,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 05:15:19,490 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 05:15:19,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 05:15:19,491 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 05:15:19,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 05:15:19,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 05:15:19,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 05:15:19,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 05:15:19,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 05:15:19,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 05:15:19,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 05:15:19,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 05:15:19,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 05:15:19,494 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f
[2024-11-07 05:15:19,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 05:15:19,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 05:15:19,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 05:15:19,808 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 05:15:19,808 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 05:15:19,809 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-25_file-38.i
[2024-11-07 05:15:21,107 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 05:15:21,327 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 05:15:21,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i
[2024-11-07 05:15:21,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b046d1665/ec34a184871241cb91a8819df01a3c93/FLAG4a707b24c
[2024-11-07 05:15:21,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b046d1665/ec34a184871241cb91a8819df01a3c93
[2024-11-07 05:15:21,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 05:15:21,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 05:15:21,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 05:15:21,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 05:15:21,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 05:15:21,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d32345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21, skipping insertion in model container
[2024-11-07 05:15:21,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,393 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 05:15:21,526 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-25_file-38.i[915,928]
[2024-11-07 05:15:21,589 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 05:15:21,600 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 05:15:21,608 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-25_file-38.i[915,928]
[2024-11-07 05:15:21,638 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 05:15:21,653 INFO L204 MainTranslator]: Completed translation
[2024-11-07 05:15:21,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21 WrapperNode
[2024-11-07 05:15:21,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 05:15:21,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 05:15:21,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 05:15:21,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 05:15:21,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,721 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221
[2024-11-07 05:15:21,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 05:15:21,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 05:15:21,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 05:15:21,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 05:15:21,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,762 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 05:15:21,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 05:15:21,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 05:15:21,798 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 05:15:21,799 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 05:15:21,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (1/1) ...
[2024-11-07 05:15:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 05:15:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:21,839 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 05:15:21,844 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 05:15:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 05:15:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 05:15:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 05:15:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 05:15:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 05:15:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 05:15:21,973 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 05:15:21,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 05:15:22,404 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-07 05:15:22,404 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 05:15:22,419 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 05:15:22,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 05:15:22,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:22 BoogieIcfgContainer
[2024-11-07 05:15:22,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 05:15:22,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 05:15:22,424 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 05:15:22,429 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 05:15:22,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:15:21" (1/3) ...
[2024-11-07 05:15:22,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954dd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:22, skipping insertion in model container
[2024-11-07 05:15:22,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:21" (2/3) ...
[2024-11-07 05:15:22,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954dd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:22, skipping insertion in model container
[2024-11-07 05:15:22,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:22" (3/3) ...
[2024-11-07 05:15:22,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i
[2024-11-07 05:15:22,445 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 05:15:22,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 05:15:22,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 05:15:22,528 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;@304f367f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 05:15:22,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 05:15:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2024-11-07 05:15:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2024-11-07 05:15:22,547 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:22,547 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:22,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1107362262, now seen corresponding path program 1 times
[2024-11-07 05:15:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980678582]
[2024-11-07 05:15:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 05:15:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 05:15:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 05:15:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 05:15:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 05:15:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 05:15:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 05:15:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 05:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 05:15:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 05:15:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 05:15:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 05:15:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 05:15:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 05:15:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 05:15:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 05:15:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 05:15:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 05:15:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 05:15:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 05:15:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 05:15:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 05:15:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-07 05:15:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133
[2024-11-07 05:15:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2024-11-07 05:15:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144
[2024-11-07 05:15:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2024-11-07 05:15:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155
[2024-11-07 05:15:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2024-11-07 05:15:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166
[2024-11-07 05:15:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2024-11-07 05:15:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177
[2024-11-07 05:15:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182
[2024-11-07 05:15:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2024-11-07 05:15:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980678582]
[2024-11-07 05:15:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980678582] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 05:15:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503603424]
[2024-11-07 05:15:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:23,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 05:15:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 05:15:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 05:15:23,173 INFO L87 Difference]: Start difference. First operand has 96 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:23,215 INFO L93 Difference]: Finished difference Result 185 states and 329 transitions.
[2024-11-07 05:15:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 05:15:23,217 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207
[2024-11-07 05:15:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:23,224 INFO L225 Difference]: With dead ends: 185
[2024-11-07 05:15:23,224 INFO L226 Difference]: Without dead ends: 92
[2024-11-07 05:15:23,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 05:15:23,230 INFO L432 NwaCegarLoop]: 144 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, 144 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 05:15:23,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 05:15:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-07 05:15:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2024-11-07 05:15:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2024-11-07 05:15:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions.
[2024-11-07 05:15:23,276 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 207
[2024-11-07 05:15:23,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:23,278 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions.
[2024-11-07 05:15:23,279 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions.
[2024-11-07 05:15:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2024-11-07 05:15:23,283 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:23,283 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:23,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 05:15:23,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:23,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -909152972, now seen corresponding path program 1 times
[2024-11-07 05:15:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:23,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071097156]
[2024-11-07 05:15:23,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 05:15:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 05:15:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 05:15:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 05:15:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 05:15:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 05:15:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 05:15:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 05:15:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 05:15:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 05:15:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 05:15:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 05:15:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 05:15:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 05:15:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 05:15:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 05:15:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 05:15:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 05:15:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 05:15:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 05:15:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 05:15:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 05:15:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-07 05:15:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133
[2024-11-07 05:15:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2024-11-07 05:15:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144
[2024-11-07 05:15:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2024-11-07 05:15:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155
[2024-11-07 05:15:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2024-11-07 05:15:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166
[2024-11-07 05:15:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2024-11-07 05:15:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177
[2024-11-07 05:15:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182
[2024-11-07 05:15:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2024-11-07 05:15:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071097156]
[2024-11-07 05:15:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071097156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 05:15:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011216530]
[2024-11-07 05:15:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:24,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 05:15:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 05:15:24,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 05:15:24,437 INFO L87 Difference]: Start difference. First operand 92 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:15:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:24,835 INFO L93 Difference]: Finished difference Result 354 states and 558 transitions.
[2024-11-07 05:15:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 05:15:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207
[2024-11-07 05:15:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:24,843 INFO L225 Difference]: With dead ends: 354
[2024-11-07 05:15:24,843 INFO L226 Difference]: Without dead ends: 265
[2024-11-07 05:15:24,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 05:15:24,845 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 348 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 05:15:24,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 546 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 05:15:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-11-07 05:15:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 179.
[2024-11-07 05:15:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2024-11-07 05:15:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 283 transitions.
[2024-11-07 05:15:24,890 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 283 transitions. Word has length 207
[2024-11-07 05:15:24,890 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:24,891 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 283 transitions.
[2024-11-07 05:15:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:15:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 283 transitions.
[2024-11-07 05:15:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-11-07 05:15:24,893 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:24,894 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:24,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 05:15:24,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1628530190, now seen corresponding path program 1 times
[2024-11-07 05:15:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445498048]
[2024-11-07 05:15:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 05:15:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 05:15:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 05:15:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 05:15:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 05:15:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 05:15:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 05:15:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 05:15:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 05:15:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 05:15:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 05:15:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 05:15:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 05:15:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 05:15:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 05:15:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 05:15:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 05:15:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 05:15:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 05:15:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 05:15:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 05:15:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 05:15:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-07 05:15:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133
[2024-11-07 05:15:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2024-11-07 05:15:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144
[2024-11-07 05:15:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2024-11-07 05:15:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155
[2024-11-07 05:15:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2024-11-07 05:15:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166
[2024-11-07 05:15:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2024-11-07 05:15:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177
[2024-11-07 05:15:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182
[2024-11-07 05:15:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2024-11-07 05:15:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:25,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445498048]
[2024-11-07 05:15:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445498048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:25,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 05:15:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318946367]
[2024-11-07 05:15:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:25,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 05:15:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 05:15:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 05:15:25,471 INFO L87 Difference]: Start difference. First operand 179 states and 283 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:15:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:25,865 INFO L93 Difference]: Finished difference Result 569 states and 901 transitions.
[2024-11-07 05:15:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 05:15:25,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208
[2024-11-07 05:15:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:25,874 INFO L225 Difference]: With dead ends: 569
[2024-11-07 05:15:25,874 INFO L226 Difference]: Without dead ends: 393
[2024-11-07 05:15:25,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 05:15:25,880 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 127 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 05:15:25,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 05:15:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2024-11-07 05:15:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 355.
[2024-11-07 05:15:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 218 states have internal predecessors, (300), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132)
[2024-11-07 05:15:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 564 transitions.
[2024-11-07 05:15:25,991 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 564 transitions. Word has length 208
[2024-11-07 05:15:25,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:25,992 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 564 transitions.
[2024-11-07 05:15:25,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:15:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 564 transitions.
[2024-11-07 05:15:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-11-07 05:15:25,998 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:25,998 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 05:15:25,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:25,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash 617412940, now seen corresponding path program 1 times
[2024-11-07 05:15:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:25,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140250662]
[2024-11-07 05:15:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 05:15:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 05:15:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 05:15:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 05:15:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 05:15:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 05:15:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 05:15:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 05:15:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 05:15:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 05:15:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 05:15:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 05:15:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 05:15:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 05:15:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 05:15:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 05:15:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 05:15:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 05:15:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 05:15:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 05:15:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 05:15:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 05:15:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-07 05:15:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133
[2024-11-07 05:15:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2024-11-07 05:15:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144
[2024-11-07 05:15:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2024-11-07 05:15:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155
[2024-11-07 05:15:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2024-11-07 05:15:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166
[2024-11-07 05:15:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2024-11-07 05:15:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177
[2024-11-07 05:15:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182
[2024-11-07 05:15:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2024-11-07 05:15:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140250662]
[2024-11-07 05:15:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140250662] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 05:15:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607464704]
[2024-11-07 05:15:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:26,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:26,450 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 05:15:26,452 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 05:15:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:26,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-07 05:15:26,632 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 05:15:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked.
[2024-11-07 05:15:27,141 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 05:15:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2024-11-07 05:15:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607464704] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 05:15:27,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 05:15:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7
[2024-11-07 05:15:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514294938]
[2024-11-07 05:15:27,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 05:15:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 05:15:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 05:15:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 05:15:27,562 INFO L87 Difference]: Start difference. First operand 355 states and 564 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66)
[2024-11-07 05:15:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:27,847 INFO L93 Difference]: Finished difference Result 626 states and 982 transitions.
[2024-11-07 05:15:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 05:15:27,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 208
[2024-11-07 05:15:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:27,855 INFO L225 Difference]: With dead ends: 626
[2024-11-07 05:15:27,855 INFO L226 Difference]: Without dead ends: 274
[2024-11-07 05:15:27,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-07 05:15:27,858 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 43 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 05:15:27,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 05:15:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2024-11-07 05:15:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266.
[2024-11-07 05:15:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 160 states have (on average 1.31875) internal successors, (211), 160 states have internal predecessors, (211), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2024-11-07 05:15:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions.
[2024-11-07 05:15:27,906 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 208
[2024-11-07 05:15:27,907 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:27,908 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions.
[2024-11-07 05:15:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66)
[2024-11-07 05:15:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions.
[2024-11-07 05:15:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-11-07 05:15:27,911 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:27,911 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:27,930 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 05:15:28,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:28,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1010439950, now seen corresponding path program 1 times
[2024-11-07 05:15:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559386301]
[2024-11-07 05:15:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 05:15:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 05:15:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 05:15:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 05:15:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 05:15:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 05:15:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 05:15:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 05:15:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 05:15:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 05:15:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 05:15:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 05:15:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 05:15:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-07 05:15:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 05:15:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 05:15:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 05:15:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-07 05:15:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 05:15:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 05:15:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 05:15:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 05:15:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-07 05:15:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133
[2024-11-07 05:15:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139
[2024-11-07 05:15:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144
[2024-11-07 05:15:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150
[2024-11-07 05:15:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155
[2024-11-07 05:15:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161
[2024-11-07 05:15:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166
[2024-11-07 05:15:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172
[2024-11-07 05:15:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177
[2024-11-07 05:15:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182
[2024-11-07 05:15:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2024-11-07 05:15:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559386301]
[2024-11-07 05:15:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559386301] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 05:15:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835837905]
[2024-11-07 05:15:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:28,676 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 05:15:28,690 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 05:15:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:28,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 05:15:28,842 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 05:15:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked.
[2024-11-07 05:15:29,449 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 05:15:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked.
[2024-11-07 05:15:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835837905] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 05:15:29,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 05:15:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17
[2024-11-07 05:15:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288945958]
[2024-11-07 05:15:29,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 05:15:29,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-07 05:15:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-07 05:15:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272
[2024-11-07 05:15:29,923 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99)
[2024-11-07 05:15:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:30,875 INFO L93 Difference]: Finished difference Result 534 states and 806 transitions.
[2024-11-07 05:15:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-07 05:15:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) Word has length 208
[2024-11-07 05:15:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:30,879 INFO L225 Difference]: With dead ends: 534
[2024-11-07 05:15:30,879 INFO L226 Difference]: Without dead ends: 343
[2024-11-07 05:15:30,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756
[2024-11-07 05:15:30,885 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 509 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-07 05:15:30,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 676 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-07 05:15:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states.
[2024-11-07 05:15:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 286.
[2024-11-07 05:15:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2024-11-07 05:15:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 434 transitions.
[2024-11-07 05:15:30,924 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 434 transitions. Word has length 208
[2024-11-07 05:15:30,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:30,924 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 434 transitions.
[2024-11-07 05:15:30,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.25) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99)
[2024-11-07 05:15:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions.
[2024-11-07 05:15:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2024-11-07 05:15:30,926 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:30,927 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:30,946 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 05:15:31,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:31,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash -33501776, now seen corresponding path program 1 times
[2024-11-07 05:15:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:31,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927254640]
[2024-11-07 05:15:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 05:15:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77910171]
[2024-11-07 05:15:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:31,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 05:15:31,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 05:15:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:31,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 05:15:31,381 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 05:15:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked.
[2024-11-07 05:15:31,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 05:15:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 05:15:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927254640]
[2024-11-07 05:15:31,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 05:15:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77910171]
[2024-11-07 05:15:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77910171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:31,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 05:15:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719745253]
[2024-11-07 05:15:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:31,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 05:15:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 05:15:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 05:15:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-07 05:15:31,747 INFO L87 Difference]: Start difference. First operand 286 states and 434 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:32,358 INFO L93 Difference]: Finished difference Result 736 states and 1108 transitions.
[2024-11-07 05:15:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 05:15:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209
[2024-11-07 05:15:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:32,363 INFO L225 Difference]: With dead ends: 736
[2024-11-07 05:15:32,364 INFO L226 Difference]: Without dead ends: 526
[2024-11-07 05:15:32,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240
[2024-11-07 05:15:32,366 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 271 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 05:15:32,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 523 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 05:15:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2024-11-07 05:15:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 512.
[2024-11-07 05:15:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 330 states have (on average 1.3363636363636364) internal successors, (441), 330 states have internal predecessors, (441), 165 states have call successors, (165), 16 states have call predecessors, (165), 16 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165)
[2024-11-07 05:15:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 771 transitions.
[2024-11-07 05:15:32,457 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 771 transitions. Word has length 209
[2024-11-07 05:15:32,457 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:32,458 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 771 transitions.
[2024-11-07 05:15:32,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 771 transitions.
[2024-11-07 05:15:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2024-11-07 05:15:32,460 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:32,460 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:32,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-07 05:15:32,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:32,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1621849678, now seen corresponding path program 1 times
[2024-11-07 05:15:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 05:15:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696890932]
[2024-11-07 05:15:32,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 05:15:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 05:15:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635105378]
[2024-11-07 05:15:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:32,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 05:15:32,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:32,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 05:15:32,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 05:15:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 05:15:32,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 05:15:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 05:15:33,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 05:15:33,137 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 05:15:33,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 05:15:33,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-07 05:15:33,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2024-11-07 05:15:33,344 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 05:15:33,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 05:15:33,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:15:33 BoogieIcfgContainer
[2024-11-07 05:15:33,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 05:15:33,515 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 05:15:33,515 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 05:15:33,515 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 05:15:33,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:22" (3/4) ...
[2024-11-07 05:15:33,518 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 05:15:33,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 05:15:33,520 INFO L158 Benchmark]: Toolchain (without parser) took 12160.78ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.3MB in the beginning and 130.8MB in the end (delta: -39.5MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB.
[2024-11-07 05:15:33,523 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 05:15:33,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.11ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 76.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 05:15:33,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.51ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 05:15:33,523 INFO L158 Benchmark]: Boogie Preprocessor took 75.47ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 05:15:33,523 INFO L158 Benchmark]: RCFGBuilder took 621.76ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 49.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 05:15:33,524 INFO L158 Benchmark]: TraceAbstraction took 11090.39ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 48.9MB in the beginning and 130.8MB in the end (delta: -82.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB.
[2024-11-07 05:15:33,524 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 234.9MB. Free memory was 130.8MB in the beginning and 130.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 05:15:33,525 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.23ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 294.11ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 76.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 65.51ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 75.47ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 621.76ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 49.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 11090.39ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 48.9MB in the beginning and 130.8MB in the end (delta: -82.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB.
* Witness Printer took 4.02ms. Allocated memory is still 234.9MB. Free memory was 130.8MB in the beginning and 130.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of shiftRight at line 80.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned char var_1_1 = 1;
[L23] unsigned char var_1_4 = 0;
[L24] unsigned char var_1_6 = 0;
[L25] unsigned char var_1_7 = 0;
[L26] unsigned short int var_1_8 = 4;
[L27] signed long int var_1_11 = 100;
[L28] signed long int var_1_12 = 8;
[L29] unsigned short int var_1_13 = 128;
[L30] double var_1_14 = 64.5;
[L31] signed short int var_1_15 = 4;
[L32] signed long int var_1_16 = -8;
[L33] double var_1_17 = 255.5;
[L34] double var_1_18 = 0.6;
[L35] double var_1_19 = 1000000000000.5;
[L36] double var_1_20 = 999999.25;
[L37] signed short int var_1_21 = -64;
[L38] signed char var_1_25 = -128;
[L39] signed char var_1_26 = -8;
[L40] unsigned char var_1_27 = 32;
[L41] double var_1_28 = 7.7;
[L42] double var_1_29 = 127.8;
[L43] unsigned char var_1_30 = 1;
[L44] signed long int var_1_31 = -16;
[L45] unsigned char var_1_32 = 0;
[L46] unsigned short int var_1_33 = 128;
[L47] signed short int var_1_34 = 50;
[L48] unsigned short int var_1_35 = 10000;
[L49] unsigned long int var_1_36 = 128;
[L50] signed char var_1_37 = 2;
[L51] unsigned short int last_1_var_1_8 = 4;
[L52] signed short int last_1_var_1_21 = -64;
[L53] signed char last_1_var_1_25 = -128;
VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4]
[L184] isInitial = 1
[L185] FCALL initially()
[L186] COND TRUE 1
[L187] CALL updateLastVariables()
[L175] last_1_var_1_8 = var_1_8
[L176] last_1_var_1_21 = var_1_21
[L177] last_1_var_1_25 = var_1_25
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4]
[L187] RET updateLastVariables()
[L188] CALL updateVariables()
[L122] var_1_4 = __VERIFIER_nondet_uchar()
[L123] CALL assume_abort_if_not(var_1_4 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L123] RET assume_abort_if_not(var_1_4 >= 1)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L124] CALL assume_abort_if_not(var_1_4 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L124] RET assume_abort_if_not(var_1_4 <= 1)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L125] var_1_6 = __VERIFIER_nondet_uchar()
[L126] CALL assume_abort_if_not(var_1_6 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4]
[L126] RET assume_abort_if_not(var_1_6 >= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_7=0, var_1_8=4]
[L127] CALL assume_abort_if_not(var_1_6 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L127] RET assume_abort_if_not(var_1_6 <= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L128] var_1_11 = __VERIFIER_nondet_long()
[L129] CALL assume_abort_if_not(var_1_11 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L129] RET assume_abort_if_not(var_1_11 >= -1)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L130] CALL assume_abort_if_not(var_1_11 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L130] RET assume_abort_if_not(var_1_11 <= 2147483647)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L131] var_1_12 = __VERIFIER_nondet_long()
[L132] CALL assume_abort_if_not(var_1_12 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L132] RET assume_abort_if_not(var_1_12 >= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L133] CALL assume_abort_if_not(var_1_12 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L133] RET assume_abort_if_not(var_1_12 <= 2147483647)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L134] var_1_13 = __VERIFIER_nondet_ushort()
[L135] CALL assume_abort_if_not(var_1_13 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L135] RET assume_abort_if_not(var_1_13 >= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L136] CALL assume_abort_if_not(var_1_13 <= 65534)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L136] RET assume_abort_if_not(var_1_13 <= 65534)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L137] var_1_15 = __VERIFIER_nondet_short()
[L138] CALL assume_abort_if_not(var_1_15 >= -32768)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L138] RET assume_abort_if_not(var_1_15 >= -32768)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L139] CALL assume_abort_if_not(var_1_15 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L139] RET assume_abort_if_not(var_1_15 <= 32767)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L140] CALL assume_abort_if_not(var_1_15 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L140] RET assume_abort_if_not(var_1_15 != 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L141] var_1_16 = __VERIFIER_nondet_long()
[L142] CALL assume_abort_if_not(var_1_16 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L142] RET assume_abort_if_not(var_1_16 >= -2147483648)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L143] CALL assume_abort_if_not(var_1_16 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L143] RET assume_abort_if_not(var_1_16 <= 2147483647)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L144] CALL assume_abort_if_not(var_1_16 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L144] RET assume_abort_if_not(var_1_16 != 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L145] var_1_17 = __VERIFIER_nondet_double()
[L146] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L146] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L147] var_1_18 = __VERIFIER_nondet_double()
[L148] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L148] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L149] var_1_19 = __VERIFIER_nondet_double()
[L150] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L150] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L151] var_1_20 = __VERIFIER_nondet_double()
[L152] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L152] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L153] var_1_26 = __VERIFIER_nondet_char()
[L154] CALL assume_abort_if_not(var_1_26 >= -127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L154] RET assume_abort_if_not(var_1_26 >= -127)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L155] CALL assume_abort_if_not(var_1_26 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L155] RET assume_abort_if_not(var_1_26 <= 126)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=77/10, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L156] var_1_28 = __VERIFIER_nondet_double()
[L157] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L157] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=639/5, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L158] var_1_29 = __VERIFIER_nondet_double()
[L159] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L159] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-16, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L160] var_1_31 = __VERIFIER_nondet_long()
[L161] CALL assume_abort_if_not(var_1_31 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L161] RET assume_abort_if_not(var_1_31 >= -2147483648)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L162] CALL assume_abort_if_not(var_1_31 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L162] RET assume_abort_if_not(var_1_31 <= 2147483647)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L163] var_1_32 = __VERIFIER_nondet_uchar()
[L164] CALL assume_abort_if_not(var_1_32 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L164] RET assume_abort_if_not(var_1_32 >= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L165] CALL assume_abort_if_not(var_1_32 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L165] RET assume_abort_if_not(var_1_32 <= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=50, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L166] var_1_34 = __VERIFIER_nondet_short()
[L167] CALL assume_abort_if_not(var_1_34 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L167] RET assume_abort_if_not(var_1_34 >= 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L168] CALL assume_abort_if_not(var_1_34 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L168] RET assume_abort_if_not(var_1_34 <= 32767)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L169] var_1_37 = __VERIFIER_nondet_char()
[L170] CALL assume_abort_if_not(var_1_37 >= -128)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L170] RET assume_abort_if_not(var_1_37 >= -128)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L171] CALL assume_abort_if_not(var_1_37 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L171] RET assume_abort_if_not(var_1_37 <= 127)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L172] CALL assume_abort_if_not(var_1_37 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L172] RET assume_abort_if_not(var_1_37 != 0)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L188] RET updateVariables()
[L189] CALL step()
[L57] COND FALSE !(0.75 <= var_1_28)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=1, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L62] COND TRUE (~ var_1_27) < var_1_31
[L63] var_1_30 = var_1_32
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L65] COND FALSE !(\read(var_1_32))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=10000, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L76] var_1_35 = var_1_27
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L77] COND FALSE !((-1 / var_1_37) >= ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L80] EXPR last_1_var_1_8 >> var_1_15
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L80] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)
[L81] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25)))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L85] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12;
[L86] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21;
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4]
[L87] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1)
[L92] var_1_8 = var_1_13
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L94] COND TRUE ! (var_1_21 > var_1_8)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L95] COND TRUE \read(var_1_4)
[L96] var_1_25 = var_1_26
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L99] COND FALSE !((8 / var_1_15) < (64 / var_1_16))
[L106] var_1_14 = var_1_18
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L108] COND TRUE (- var_1_14) <= var_1_14
[L109] var_1_1 = var_1_4
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L117] COND FALSE !(var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L189] RET step()
[L190] CALL, EXPR property()
[L180] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L180-L181] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1)
;
[L190] RET, EXPR property()
[L190] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=8, var_1_16=64, var_1_18=2, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=32, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=128, var_1_34=0, var_1_35=32, var_1_36=128, var_1_37=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 7, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1358 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1298 mSDsluCounter, 2646 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1842 mSDsCounter, 579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 579 mSolverCounterUnsat, 804 mSDtfsCounter, 1645 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1391 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=512occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 203 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2069 ConstructedInterpolants, 0 QuantifiedInterpolants, 6784 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 20652/21120 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 05:15:33,562 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-25_file-38.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 c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 05:15:35,964 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 05:15:36,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 05:15:36,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 05:15:36,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 05:15:36,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 05:15:36,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 05:15:36,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 05:15:36,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 05:15:36,137 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 05:15:36,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 05:15:36,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 05:15:36,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 05:15:36,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 05:15:36,138 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 05:15:36,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 05:15:36,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 05:15:36,138 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 05:15:36,138 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 05:15:36,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 05:15:36,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 05:15:36,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 05:15:36,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 05:15:36,140 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 -> c09ae5383c303ea70fa8be3591cb19f07b66ade63b6f0323637dd7a8d6da530f
[2024-11-07 05:15:36,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 05:15:36,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 05:15:36,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 05:15:36,511 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 05:15:36,512 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 05:15:36,513 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-25_file-38.i
[2024-11-07 05:15:37,890 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 05:15:38,135 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 05:15:38,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-38.i
[2024-11-07 05:15:38,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfbd35b42/60f56ba57edb4a28bb53ced5a3915d5b/FLAG1f4905cdd
[2024-11-07 05:15:38,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfbd35b42/60f56ba57edb4a28bb53ced5a3915d5b
[2024-11-07 05:15:38,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 05:15:38,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 05:15:38,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 05:15:38,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 05:15:38,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 05:15:38,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180a40d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38, skipping insertion in model container
[2024-11-07 05:15:38,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,198 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 05:15:38,333 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-25_file-38.i[915,928]
[2024-11-07 05:15:38,393 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 05:15:38,415 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 05:15:38,425 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-25_file-38.i[915,928]
[2024-11-07 05:15:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 05:15:38,488 INFO L204 MainTranslator]: Completed translation
[2024-11-07 05:15:38,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38 WrapperNode
[2024-11-07 05:15:38,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 05:15:38,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 05:15:38,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 05:15:38,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 05:15:38,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,535 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194
[2024-11-07 05:15:38,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 05:15:38,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 05:15:38,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 05:15:38,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 05:15:38,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,563 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 05:15:38,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 05:15:38,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 05:15:38,586 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 05:15:38,587 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 05:15:38,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (1/1) ...
[2024-11-07 05:15:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 05:15:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 05:15:38,630 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 05:15:38,636 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 05:15:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 05:15:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 05:15:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 05:15:38,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 05:15:38,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 05:15:38,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 05:15:38,766 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 05:15:38,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 05:15:45,022 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2024-11-07 05:15:45,023 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 05:15:45,036 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 05:15:45,037 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 05:15:45,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:45 BoogieIcfgContainer
[2024-11-07 05:15:45,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 05:15:45,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 05:15:45,040 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 05:15:45,044 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 05:15:45,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:15:38" (1/3) ...
[2024-11-07 05:15:45,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b063cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:45, skipping insertion in model container
[2024-11-07 05:15:45,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:38" (2/3) ...
[2024-11-07 05:15:45,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b063cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:45, skipping insertion in model container
[2024-11-07 05:15:45,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:45" (3/3) ...
[2024-11-07 05:15:45,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-38.i
[2024-11-07 05:15:45,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 05:15:45,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 05:15:45,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 05:15:45,145 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;@c20c29e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 05:15:45,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 05:15:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2024-11-07 05:15:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2024-11-07 05:15:45,165 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:45,166 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:45,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -73127337, now seen corresponding path program 1 times
[2024-11-07 05:15:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 05:15:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692961882]
[2024-11-07 05:15:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:45,181 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 05:15:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 05:15:45,184 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 05:15:45,187 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 05:15:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:45,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 05:15:45,755 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 05:15:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked.
[2024-11-07 05:15:45,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 05:15:45,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 05:15:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692961882]
[2024-11-07 05:15:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692961882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:45,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 05:15:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036366971]
[2024-11-07 05:15:45,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:45,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 05:15:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 05:15:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 05:15:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 05:15:45,847 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:15:45,892 INFO L93 Difference]: Finished difference Result 171 states and 309 transitions.
[2024-11-07 05:15:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 05:15:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204
[2024-11-07 05:15:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:15:45,906 INFO L225 Difference]: With dead ends: 171
[2024-11-07 05:15:45,906 INFO L226 Difference]: Without dead ends: 85
[2024-11-07 05:15:45,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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 05:15:45,915 INFO L432 NwaCegarLoop]: 133 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, 133 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 05:15:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 05:15:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2024-11-07 05:15:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2024-11-07 05:15:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2024-11-07 05:15:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions.
[2024-11-07 05:15:45,978 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 204
[2024-11-07 05:15:45,980 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:15:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions.
[2024-11-07 05:15:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)
[2024-11-07 05:15:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions.
[2024-11-07 05:15:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2024-11-07 05:15:45,984 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:15:45,985 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:46,013 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 05:15:46,188 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 05:15:46,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:15:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:15:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 947424527, now seen corresponding path program 1 times
[2024-11-07 05:15:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 05:15:46,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509299880]
[2024-11-07 05:15:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:15:46,192 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 05:15:46,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 05:15:46,197 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 05:15:46,200 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 05:15:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:15:46,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 05:15:46,813 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 05:15:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2024-11-07 05:15:49,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 05:15:49,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 05:15:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509299880]
[2024-11-07 05:15:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509299880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 05:15:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 05:15:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 05:15:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160061894]
[2024-11-07 05:15:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 05:15:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 05:15:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 05:15:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 05:15:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 05:15:49,483 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:15:54,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 05:15:56,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 05:16:01,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 05:16:02,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 05:16:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 05:16:02,262 INFO L93 Difference]: Finished difference Result 392 states and 619 transitions.
[2024-11-07 05:16:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 05:16:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204
[2024-11-07 05:16:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 05:16:02,268 INFO L225 Difference]: With dead ends: 392
[2024-11-07 05:16:02,269 INFO L226 Difference]: Without dead ends: 310
[2024-11-07 05:16:02,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 05:16:02,271 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 225 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 67 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time
[2024-11-07 05:16:02,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 732 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time]
[2024-11-07 05:16:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2024-11-07 05:16:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 165.
[2024-11-07 05:16:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2024-11-07 05:16:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions.
[2024-11-07 05:16:02,322 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 204
[2024-11-07 05:16:02,323 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 05:16:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions.
[2024-11-07 05:16:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2024-11-07 05:16:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions.
[2024-11-07 05:16:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2024-11-07 05:16:02,327 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 05:16:02,327 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:16:02,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 05:16:02,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 05:16:02,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 05:16:02,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 05:16:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1743393936, now seen corresponding path program 1 times
[2024-11-07 05:16:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 05:16:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347113999]
[2024-11-07 05:16:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 05:16:02,530 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 05:16:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 05:16:02,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 05:16:02,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 05:16:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 05:16:02,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-07 05:16:03,001 INFO L278 TraceCheckSpWp]: Computing forward predicates...