./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 3289d67d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d3eac94ab0c7cf6fc17507626d85e821af2b5795e07a82a02c7c055a57a1c94b
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m
[2024-11-16 06:13:31,545 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-16 06:13:31,618 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-16 06:13:31,623 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-16 06:13:31,624 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-16 06:13:31,652 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-16 06:13:31,654 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-16 06:13:31,655 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-16 06:13:31,655 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-16 06:13:31,657 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-16 06:13:31,658 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-16 06:13:31,658 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-16 06:13:31,659 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-16 06:13:31,660 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-16 06:13:31,660 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-16 06:13:31,661 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-16 06:13:31,661 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-16 06:13:31,661 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-16 06:13:31,662 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-16 06:13:31,665 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-16 06:13:31,665 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-16 06:13:31,666 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-16 06:13:31,666 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-16 06:13:31,666 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-16 06:13:31,667 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-16 06:13:31,667 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-16 06:13:31,667 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-16 06:13:31,668 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-16 06:13:31,668 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-16 06:13:31,668 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-16 06:13:31,669 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-16 06:13:31,669 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-16 06:13:31,669 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-16 06:13:31,669 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-16 06:13:31,670 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-16 06:13:31,670 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-16 06:13:31,670 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-16 06:13:31,670 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-16 06:13:31,671 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-16 06:13:31,671 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-16 06:13:31,671 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-16 06:13:31,672 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-16 06:13:31,672 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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/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 -> d3eac94ab0c7cf6fc17507626d85e821af2b5795e07a82a02c7c055a57a1c94b
[2024-11-16 06:13:31,902 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-16 06:13:31,921 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-16 06:13:31,924 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-16 06:13:31,925 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-16 06:13:31,926 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-16 06:13:31,927 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i
[2024-11-16 06:13:33,323 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-16 06:13:33,581 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-16 06:13:33,584 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i
[2024-11-16 06:13:33,608 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c831ca9d/650adbca762448b199f9053491c6b57c/FLAGa86b39c98
[2024-11-16 06:13:33,625 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c831ca9d/650adbca762448b199f9053491c6b57c
[2024-11-16 06:13:33,629 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-16 06:13:33,631 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-16 06:13:33,634 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-16 06:13:33,634 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-16 06:13:33,639 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-16 06:13:33,640 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:33" (1/1) ...
[2024-11-16 06:13:33,641 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f45ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:33, skipping insertion in model container
[2024-11-16 06:13:33,642 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:33" (1/1) ...
[2024-11-16 06:13:33,704 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-16 06:13:34,211 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception:
java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3125)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$150(StandardFunctionHandler.java:621)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1611)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:791)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1761)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1167)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:388)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1638)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3519)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116)
	at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.<init>(MainTranslator.java:94)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2024-11-16 06:13:34,217 INFO  L158              Benchmark]: Toolchain (without parser) took 585.68ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 67.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-16 06:13:34,218 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-16 06:13:34,218 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 581.80ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 68.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-16 06:13:34,219 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.17ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 581.80ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 68.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan
    de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d3eac94ab0c7cf6fc17507626d85e821af2b5795e07a82a02c7c055a57a1c94b
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m
[2024-11-16 06:13:36,258 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-16 06:13:36,343 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-16 06:13:36,349 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-16 06:13:36,349 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-16 06:13:36,375 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-16 06:13:36,376 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-16 06:13:36,376 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-16 06:13:36,377 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-16 06:13:36,380 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-16 06:13:36,380 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-16 06:13:36,381 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-16 06:13:36,381 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-16 06:13:36,381 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-16 06:13:36,382 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-16 06:13:36,382 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-16 06:13:36,382 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-16 06:13:36,383 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-16 06:13:36,383 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-16 06:13:36,384 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-16 06:13:36,384 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-16 06:13:36,384 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-16 06:13:36,385 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-16 06:13:36,385 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-16 06:13:36,386 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-16 06:13:36,386 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-16 06:13:36,386 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-16 06:13:36,386 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-16 06:13:36,387 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-16 06:13:36,387 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-16 06:13:36,387 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-16 06:13:36,387 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-16 06:13:36,388 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-16 06:13:36,388 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-16 06:13:36,388 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-16 06:13:36,389 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-16 06:13:36,389 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-16 06:13:36,389 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-16 06:13:36,389 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-16 06:13:36,390 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-16 06:13:36,390 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-16 06:13:36,391 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-16 06:13:36,391 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-16 06:13:36,391 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-16 06:13:36,392 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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/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 -> d3eac94ab0c7cf6fc17507626d85e821af2b5795e07a82a02c7c055a57a1c94b
[2024-11-16 06:13:36,682 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-16 06:13:36,705 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-16 06:13:36,710 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-16 06:13:36,711 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-16 06:13:36,712 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-16 06:13:36,713 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i
[2024-11-16 06:13:38,345 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-16 06:13:38,632 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-16 06:13:38,633 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i
[2024-11-16 06:13:38,656 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9bd70bd/09e95594faa3452a8de1b2f99ae7f812/FLAGface8e0a0
[2024-11-16 06:13:38,675 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9bd70bd/09e95594faa3452a8de1b2f99ae7f812
[2024-11-16 06:13:38,677 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-16 06:13:38,678 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-16 06:13:38,680 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-16 06:13:38,680 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-16 06:13:38,685 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-16 06:13:38,687 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:38" (1/1) ...
[2024-11-16 06:13:38,688 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51375143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:38, skipping insertion in model container
[2024-11-16 06:13:38,688 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:13:38" (1/1) ...
[2024-11-16 06:13:38,731 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-16 06:13:39,448 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i[63649,63662]
[2024-11-16 06:13:39,458 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-16 06:13:39,473 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-16 06:13:39,532 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_2_safe.c-amalgamation.i[63649,63662]
[2024-11-16 06:13:39,534 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-16 06:13:39,713 INFO  L204         MainTranslator]: Completed translation
[2024-11-16 06:13:39,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39 WrapperNode
[2024-11-16 06:13:39,714 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-16 06:13:39,715 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-16 06:13:39,715 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-16 06:13:39,715 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-16 06:13:39,723 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,758 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,792 INFO  L138                Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 118
[2024-11-16 06:13:39,795 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-16 06:13:39,796 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-16 06:13:39,796 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-16 06:13:39,797 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-16 06:13:39,807 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,807 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,814 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,842 INFO  L175           MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 12, 4]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 4, 2].
[2024-11-16 06:13:39,844 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,844 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,860 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,861 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,863 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,864 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,869 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-16 06:13:39,870 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-16 06:13:39,870 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2024-11-16 06:13:39,870 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2024-11-16 06:13:39,872 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (1/1) ...
[2024-11-16 06:13:39,882 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-16 06:13:39,895 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-16 06:13:39,914 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-16 06:13:39,919 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-16 06:13:39,966 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-16 06:13:39,967 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-16 06:13:39,968 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-16 06:13:39,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2024-11-16 06:13:39,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2024-11-16 06:13:39,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2
[2024-11-16 06:13:39,968 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3
[2024-11-16 06:13:39,968 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-16 06:13:40,120 INFO  L256             CfgBuilder]: Building ICFG
[2024-11-16 06:13:40,123 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-16 06:13:41,388 INFO  L1250  $ProcedureCfgBuilder]: dead code at ProgramPoint L863: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;
[2024-11-16 06:13:41,401 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-16 06:13:41,401 INFO  L307             CfgBuilder]: Performing block encoding
[2024-11-16 06:13:41,413 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-16 06:13:41,414 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-16 06:13:41,414 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:13:41 BoogieIcfgContainer
[2024-11-16 06:13:41,414 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-16 06:13:41,416 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-16 06:13:41,418 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-16 06:13:41,421 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-16 06:13:41,421 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:13:38" (1/3) ...
[2024-11-16 06:13:41,422 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573dd7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:13:41, skipping insertion in model container
[2024-11-16 06:13:41,422 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:13:39" (2/3) ...
[2024-11-16 06:13:41,422 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573dd7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:13:41, skipping insertion in model container
[2024-11-16 06:13:41,424 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:13:41" (3/3) ...
[2024-11-16 06:13:41,425 INFO  L112   eAbstractionObserver]: Analyzing ICFG softmax_2_safe.c-amalgamation.i
[2024-11-16 06:13:41,442 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-16 06:13:41,443 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-16 06:13:41,493 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-16 06:13:41,499 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;@3109ca39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-16 06:13:41,499 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-16 06:13:41,503 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:41,509 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-16 06:13:41,509 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:41,510 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-16 06:13:41,510 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:41,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:41,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160274023, now seen corresponding path program 1 times
[2024-11-16 06:13:41,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:41,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142232023]
[2024-11-16 06:13:41,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-16 06:13:41,526 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-16 06:13:41,526 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:41,528 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-16 06:13:41,529 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-16 06:13:41,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-16 06:13:41,659 INFO  L255         TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-16 06:13:41,683 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-16 06:13:41,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-16 06:13:41,702 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-16 06:13:41,703 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-16 06:13:41,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142232023]
[2024-11-16 06:13:41,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142232023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-16 06:13:41,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-16 06:13:41,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-16 06:13:41,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958146689]
[2024-11-16 06:13:41,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-16 06:13:41,710 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-16 06:13:41,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-16 06:13:41,732 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-16 06:13:41,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-16 06:13:41,734 INFO  L87              Difference]: Start difference. First operand  has 29 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:41,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-16 06:13:41,745 INFO  L93              Difference]: Finished difference Result 55 states and 76 transitions.
[2024-11-16 06:13:41,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-16 06:13:41,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2024-11-16 06:13:41,747 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-16 06:13:41,751 INFO  L225             Difference]: With dead ends: 55
[2024-11-16 06:13:41,752 INFO  L226             Difference]: Without dead ends: 25
[2024-11-16 06:13:41,753 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-16 06:13:41,756 INFO  L432           NwaCegarLoop]: 32 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, 32 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-16 06:13:41,757 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-16 06:13:41,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2024-11-16 06:13:41,780 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2024-11-16 06:13:41,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:41,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions.
[2024-11-16 06:13:41,782 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18
[2024-11-16 06:13:41,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-16 06:13:41,783 INFO  L471      AbstractCegarLoop]: Abstraction has 25 states and 28 transitions.
[2024-11-16 06:13:41,783 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:41,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions.
[2024-11-16 06:13:41,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-16 06:13:41,784 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:41,785 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-16 06:13:41,790 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-16 06:13:41,985 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-16 06:13:41,986 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:41,987 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:41,987 INFO  L85        PathProgramCache]: Analyzing trace with hash 1807380313, now seen corresponding path program 1 times
[2024-11-16 06:13:41,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:41,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939611730]
[2024-11-16 06:13:41,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-16 06:13:41,988 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-16 06:13:41,989 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:41,990 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-16 06:13:41,991 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-16 06:13:42,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-16 06:13:42,115 INFO  L255         TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-16 06:13:42,119 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-16 06:13:42,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-16 06:13:42,220 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-16 06:13:42,220 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-16 06:13:42,221 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939611730]
[2024-11-16 06:13:42,221 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939611730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-16 06:13:42,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-16 06:13:42,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-16 06:13:42,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967591708]
[2024-11-16 06:13:42,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-16 06:13:42,231 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-16 06:13:42,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-16 06:13:42,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-16 06:13:42,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-16 06:13:42,232 INFO  L87              Difference]: Start difference. First operand 25 states and 28 transitions. Second operand  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:43,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-16 06:13:43,178 INFO  L93              Difference]: Finished difference Result 40 states and 46 transitions.
[2024-11-16 06:13:43,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-16 06:13:43,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2024-11-16 06:13:43,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-16 06:13:43,180 INFO  L225             Difference]: With dead ends: 40
[2024-11-16 06:13:43,180 INFO  L226             Difference]: Without dead ends: 29
[2024-11-16 06:13:43,181 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-16 06:13:43,182 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-16 06:13:43,182 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-16 06:13:43,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2024-11-16 06:13:43,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27.
[2024-11-16 06:13:43,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:43,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions.
[2024-11-16 06:13:43,191 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21
[2024-11-16 06:13:43,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-16 06:13:43,191 INFO  L471      AbstractCegarLoop]: Abstraction has 27 states and 30 transitions.
[2024-11-16 06:13:43,191 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:43,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2024-11-16 06:13:43,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-16 06:13:43,192 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:43,192 INFO  L215           NwaCegarLoop]: trace histogram [2, 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-16 06:13:43,198 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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-16 06:13:43,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-16 06:13:43,394 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:43,394 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:43,394 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038493733, now seen corresponding path program 1 times
[2024-11-16 06:13:43,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:43,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277077002]
[2024-11-16 06:13:43,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-16 06:13:43,395 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-16 06:13:43,396 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:43,397 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-16 06:13:43,398 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/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-16 06:13:43,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-16 06:13:43,542 INFO  L255         TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-16 06:13:43,544 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-16 06:13:43,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-16 06:13:43,656 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-16 06:13:43,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-16 06:13:43,745 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-16 06:13:43,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277077002]
[2024-11-16 06:13:43,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277077002] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-16 06:13:43,746 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-16 06:13:43,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2024-11-16 06:13:43,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20687172]
[2024-11-16 06:13:43,747 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-16 06:13:43,747 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-16 06:13:43,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-16 06:13:43,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-16 06:13:43,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-16 06:13:43,749 INFO  L87              Difference]: Start difference. First operand 27 states and 30 transitions. Second operand  has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:44,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-16 06:13:44,633 INFO  L93              Difference]: Finished difference Result 46 states and 54 transitions.
[2024-11-16 06:13:44,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-16 06:13:44,633 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25
[2024-11-16 06:13:44,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-16 06:13:44,634 INFO  L225             Difference]: With dead ends: 46
[2024-11-16 06:13:44,634 INFO  L226             Difference]: Without dead ends: 35
[2024-11-16 06:13:44,635 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-16 06:13:44,636 INFO  L432           NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-16 06:13:44,636 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-16 06:13:44,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2024-11-16 06:13:44,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2024-11-16 06:13:44,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:44,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions.
[2024-11-16 06:13:44,641 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25
[2024-11-16 06:13:44,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-16 06:13:44,642 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 40 transitions.
[2024-11-16 06:13:44,642 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:44,642 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions.
[2024-11-16 06:13:44,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2024-11-16 06:13:44,643 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:44,643 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-16 06:13:44,650 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0
[2024-11-16 06:13:44,843 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-16 06:13:44,844 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:44,845 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:44,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -151808033, now seen corresponding path program 2 times
[2024-11-16 06:13:44,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:44,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984764142]
[2024-11-16 06:13:44,845 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-16 06:13:44,846 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-16 06:13:44,846 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:44,849 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-16 06:13:44,851 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-16 06:13:44,958 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-16 06:13:44,958 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-16 06:13:44,961 INFO  L255         TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-16 06:13:44,963 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-16 06:13:45,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-11-16 06:13:45,091 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-16 06:13:45,091 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-16 06:13:45,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984764142]
[2024-11-16 06:13:45,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [984764142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-16 06:13:45,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-16 06:13:45,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-16 06:13:45,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449533838]
[2024-11-16 06:13:45,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-16 06:13:45,095 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-16 06:13:45,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-16 06:13:45,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-16 06:13:45,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-16 06:13:45,096 INFO  L87              Difference]: Start difference. First operand 35 states and 40 transitions. Second operand  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:46,761 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-16 06:13:46,807 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-16 06:13:46,808 INFO  L93              Difference]: Finished difference Result 47 states and 54 transitions.
[2024-11-16 06:13:46,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-16 06:13:46,808 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33
[2024-11-16 06:13:46,808 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-16 06:13:46,809 INFO  L225             Difference]: With dead ends: 47
[2024-11-16 06:13:46,809 INFO  L226             Difference]: Without dead ends: 40
[2024-11-16 06:13:46,809 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-16 06:13:46,810 INFO  L432           NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-16 06:13:46,810 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-16 06:13:46,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2024-11-16 06:13:46,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39.
[2024-11-16 06:13:46,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:46,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions.
[2024-11-16 06:13:46,820 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 33
[2024-11-16 06:13:46,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-16 06:13:46,821 INFO  L471      AbstractCegarLoop]: Abstraction has 39 states and 44 transitions.
[2024-11-16 06:13:46,821 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:46,821 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions.
[2024-11-16 06:13:46,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2024-11-16 06:13:46,824 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:46,824 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-16 06:13:46,830 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-11-16 06:13:47,024 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-16 06:13:47,025 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:47,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:47,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 1267410085, now seen corresponding path program 1 times
[2024-11-16 06:13:47,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:47,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797172116]
[2024-11-16 06:13:47,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-16 06:13:47,026 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-16 06:13:47,026 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:47,028 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-16 06:13:47,029 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-16 06:13:47,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-16 06:13:47,355 INFO  L255         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-16 06:13:47,358 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-16 06:13:47,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-16 06:13:47,513 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-16 06:13:47,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-16 06:13:47,654 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-16 06:13:47,655 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797172116]
[2024-11-16 06:13:47,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797172116] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-16 06:13:47,655 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-16 06:13:47,655 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-16 06:13:47,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247198856]
[2024-11-16 06:13:47,655 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-16 06:13:47,656 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-16 06:13:47,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-16 06:13:47,657 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-16 06:13:47,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-16 06:13:47,657 INFO  L87              Difference]: Start difference. First operand 39 states and 44 transitions. Second operand  has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:50,659 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-16 06:13:50,660 INFO  L93              Difference]: Finished difference Result 63 states and 74 transitions.
[2024-11-16 06:13:50,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-16 06:13:50,661 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38
[2024-11-16 06:13:50,661 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-16 06:13:50,661 INFO  L225             Difference]: With dead ends: 63
[2024-11-16 06:13:50,662 INFO  L226             Difference]: Without dead ends: 54
[2024-11-16 06:13:50,662 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-16 06:13:50,663 INFO  L432           NwaCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2024-11-16 06:13:50,663 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 80 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2024-11-16 06:13:50,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-16 06:13:50,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-16 06:13:50,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:50,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions.
[2024-11-16 06:13:50,672 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 38
[2024-11-16 06:13:50,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-16 06:13:50,672 INFO  L471      AbstractCegarLoop]: Abstraction has 54 states and 59 transitions.
[2024-11-16 06:13:50,672 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-16 06:13:50,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions.
[2024-11-16 06:13:50,674 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2024-11-16 06:13:50,674 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-16 06:13:50,674 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-16 06:13:50,685 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2024-11-16 06:13:50,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-16 06:13:50,877 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-16 06:13:50,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-16 06:13:50,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660113955, now seen corresponding path program 2 times
[2024-11-16 06:13:50,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-16 06:13:50,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023121626]
[2024-11-16 06:13:50,878 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-16 06:13:50,878 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-16 06:13:50,878 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-16 06:13:50,879 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-16 06:13:50,880 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-16 06:13:52,281 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-16 06:13:52,281 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-16 06:13:52,281 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-16 06:13:53,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-16 06:13:53,569 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-11-16 06:13:53,569 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-16 06:13:53,570 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-16 06:13:53,605 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2024-11-16 06:13:53,772 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-16 06:13:53,775 INFO  L407         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1]
[2024-11-16 06:13:53,822 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-16 06:13:53,826 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:13:53 BoogieIcfgContainer
[2024-11-16 06:13:53,826 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-16 06:13:53,827 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-16 06:13:53,827 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-16 06:13:53,828 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-16 06:13:53,828 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:13:41" (3/4) ...
[2024-11-16 06:13:53,830 INFO  L146         WitnessPrinter]: No result that supports witness generation found
[2024-11-16 06:13:53,831 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-16 06:13:53,832 INFO  L158              Benchmark]: Toolchain (without parser) took 15153.63ms. Allocated memory was 54.5MB in the beginning and 92.3MB in the end (delta: 37.7MB). Free memory was 34.1MB in the beginning and 46.3MB in the end (delta: -12.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,832 INFO  L158              Benchmark]: CDTParser took 3.24ms. Allocated memory is still 41.9MB. Free memory was 18.1MB in the beginning and 26.7MB in the end (delta: -8.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,833 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1034.47ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 42.3MB in the end (delta: -8.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,835 INFO  L158              Benchmark]: Boogie Procedure Inliner took 80.65ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 39.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,835 INFO  L158              Benchmark]: Boogie Preprocessor took 73.23ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 36.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,835 INFO  L158              Benchmark]: IcfgBuilder took 1544.31ms. Allocated memory is still 69.2MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: -14.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,836 INFO  L158              Benchmark]: TraceAbstraction took 12409.94ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 36.1MB in the beginning and 47.0MB in the end (delta: -10.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB.
[2024-11-16 06:13:53,836 INFO  L158              Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.3MB in the end (delta: 677.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-16 06:13:53,838 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 3.24ms. Allocated memory is still 41.9MB. Free memory was 18.1MB in the beginning and 26.7MB in the end (delta: -8.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 1034.47ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 42.3MB in the end (delta: -8.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 80.65ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 39.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 73.23ms. Allocated memory is still 69.2MB. Free memory was 38.8MB in the beginning and 36.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1544.31ms. Allocated memory is still 69.2MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: -14.5kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12409.94ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 36.1MB in the beginning and 47.0MB in the end (delta: -10.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB.
 * Witness Printer took 4.71ms. Allocated memory is still 92.3MB. Free memory was 47.0MB in the beginning and 46.3MB in the end (delta: 677.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 873]: 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 expf at line 854, overapproximation of __builtin_isinf_sign at line 871. 
Possible FailurePath: 
[L863]              float x[4], y[4];
[L864]              x[0] = __VERIFIER_nondet_float()
[L865]              x[1] = __VERIFIER_nondet_float()
[L866]              x[2] = __VERIFIER_nondet_float()
[L867]              x[3] = __VERIFIER_nondet_float()
[L868]  EXPR        x[0]
[L868]  COND FALSE  !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0])))
[L869]  EXPR        x[1]
[L869]  COND FALSE  !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1])))
[L870]  EXPR        x[2]
[L870]  COND FALSE  !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2])))
[L871]  EXPR        x[3]
[L871]  COND FALSE  !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3])))
[L872]  CALL        softmax(x, y, 4)
[L847]              int i;
[L848]  EXPR        x[0]
[L848]              float max = x[0];
[L849]              i = 1
        VAL         [i=1, max=0.0, n=4, x={7:0}, y={3:0}]
[L849]  COND TRUE   i < n
[L850]  EXPR        x[i]
[L850]  COND TRUE   x[i] > max
[L851]  EXPR        x[i]
[L851]              max = x[i]
        VAL         [i=1, max=2.0, n=4, x={7:0}, y={3:0}]
[L849]              ++i
        VAL         [i=2, max=2.0, n=4, x={7:0}, y={3:0}]
[L849]  COND TRUE   i < n
[L850]  EXPR        x[i]
[L850]  COND TRUE   x[i] > max
[L851]  EXPR        x[i]
[L851]              max = x[i]
        VAL         [i=2, max=36893496943512125000, n=4, x={7:0}, y={3:0}]
[L849]              ++i
        VAL         [i=3, max=36893496943512125000, n=4, x={7:0}, y={3:0}]
[L849]  COND TRUE   i < n
[L850]  EXPR        x[i]
[L850]  COND TRUE   x[i] > max
[L851]  EXPR        x[i]
[L851]              max = x[i]
        VAL         [i=3, max=158456325028528680000000000000, n=4, x={7:0}, y={3:0}]
[L849]              ++i
        VAL         [i=4, max=158456325028528680000000000000, n=4, x={7:0}, y={3:0}]
[L849]  COND FALSE  !(i < n)
        VAL         [max=158456325028528680000000000000, n=4, x={7:0}, y={3:0}]
[L852]              float sum = 0.0f;
[L853]              i = 0
        VAL         [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}]
[L853]  COND TRUE   i < n
        VAL         [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}]
[L854]  EXPR        x[i]
[L854]              float z = expf(x[i] - max);
[L855]              sum += z
[L856]              y[i] = z
[L853]              ++i
        VAL         [i=1, max=158456325028528680000000000000, n=4, sum=-0.000000000000000000000000000000000000011754943508222875, x={7:0}, y={3:0}]
[L853]  COND TRUE   i < n
        VAL         [i=1, max=158456325028528680000000000000, n=4, sum=-0.000000000000000000000000000000000000011754943508222875, x={7:0}, y={3:0}]
[L854]  EXPR        x[i]
[L854]              float z = expf(x[i] - max);
[L855]              sum += z
[L856]              y[i] = z
[L853]              ++i
        VAL         [i=2, max=158456325028528680000000000000, n=4, sum=-0.00000000000000000000000000000000008596243824741387, x={7:0}, y={3:0}]
[L853]  COND TRUE   i < n
        VAL         [i=2, max=158456325028528680000000000000, n=4, sum=-0.00000000000000000000000000000000008596243824741387, x={7:0}, y={3:0}]
[L854]  EXPR        x[i]
[L854]              float z = expf(x[i] - max);
[L855]              sum += z
[L856]              y[i] = z
[L853]              ++i
        VAL         [i=3, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000015029387714903977, x={7:0}, y={3:0}]
[L853]  COND TRUE   i < n
        VAL         [i=3, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000015029387714903977, x={7:0}, y={3:0}]
[L854]  EXPR        x[i]
[L854]              float z = expf(x[i] - max);
[L855]              sum += z
[L856]              y[i] = z
[L853]              ++i
        VAL         [i=4, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L853]  COND FALSE  !(i < n)
        VAL         [max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]              i = 0
        VAL         [i=0, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]  COND TRUE   i < n
[L859]  EXPR        y[i]
[L859]              y[i] /= sum
[L858]              ++i
        VAL         [i=1, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]  COND TRUE   i < n
[L859]  EXPR        y[i]
[L859]              y[i] /= sum
[L858]              ++i
        VAL         [i=2, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]  COND TRUE   i < n
[L859]  EXPR        y[i]
[L859]              y[i] /= sum
[L858]              ++i
        VAL         [i=3, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]  COND TRUE   i < n
[L859]  EXPR        y[i]
[L859]              y[i] /= sum
[L858]              ++i
        VAL         [i=4, max=158456325028528680000000000000, n=4, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L858]  COND FALSE  !(i < n)
        VAL         [max=158456325028528680000000000000, sum=0.0000000000000000000000000000000038148108782304456, x={7:0}, y={3:0}]
[L872]  RET         softmax(x, y, 4)
[L873]  EXPR        y[0]
[L873]  COND TRUE   !(__builtin_isgreaterequal(y[0], 0.0f))
[L873]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 125 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 188 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 58/66 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-16 06:13:53,876 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample