./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX --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 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:48:25,162 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:48:25,231 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 17:48:25,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:48:25,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:48:25,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:48:25,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:48:25,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:48:25,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:48:25,266 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:48:25,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:48:25,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:48:25,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:48:25,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:48:25,268 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:48:25,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:48:25,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:48:25,270 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:48:25,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:48:25,271 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:48:25,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:48:25,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:48:25,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:48:25,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:48:25,274 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:48:25,274 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:48:25,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:48:25,275 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:48:25,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:48:25,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:48:25,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:48:25,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:48:25,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:48:25,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:48:25,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:48:25,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:48:25,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:48:25,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:48:25,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:48:25,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:48:25,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:48:25,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:48:25,309 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX
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 -> 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7
[2024-11-08 17:48:25,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:48:25,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:48:25,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:48:25,671 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:48:25,672 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:48:25,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i
Unable to find full path for "g++"
[2024-11-08 17:48:28,063 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:48:28,373 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:48:28,373 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i
[2024-11-08 17:48:28,384 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/8b845314a/cd3d3a020e64435289869c232e879c28/FLAGecd76d4f6
[2024-11-08 17:48:28,401 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/8b845314a/cd3d3a020e64435289869c232e879c28
[2024-11-08 17:48:28,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:48:28,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:48:28,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:48:28,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:48:28,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:48:28,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59d8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28, skipping insertion in model container
[2024-11-08 17:48:28,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,450 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:48:28,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928]
[2024-11-08 17:48:28,730 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:48:28,744 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:48:28,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928]
[2024-11-08 17:48:28,778 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:48:28,801 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:48:28,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28 WrapperNode
[2024-11-08 17:48:28,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:48:28,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:48:28,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:48:28,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:48:28,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,847 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78
[2024-11-08 17:48:28,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:48:28,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:48:28,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:48:28,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:48:28,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,887 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 17:48:28,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:48:28,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:48:28,914 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:48:28,915 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:48:28,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (1/1) ...
[2024-11-08 17:48:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:48:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:48:28,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:48:28,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:48:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:48:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:48:29,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:48:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:48:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:48:29,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:48:29,119 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:48:29,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:48:29,363 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-08 17:48:29,364 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:48:29,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:48:29,379 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:48:29,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:29 BoogieIcfgContainer
[2024-11-08 17:48:29,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:48:29,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:48:29,384 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:48:29,388 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:48:29,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:48:28" (1/3) ...
[2024-11-08 17:48:29,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8c3196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:29, skipping insertion in model container
[2024-11-08 17:48:29,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:28" (2/3) ...
[2024-11-08 17:48:29,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8c3196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:29, skipping insertion in model container
[2024-11-08 17:48:29,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:29" (3/3) ...
[2024-11-08 17:48:29,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-20.i
[2024-11-08 17:48:29,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:48:29,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:48:29,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:48:29,502 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;@799c8ce1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:48:29,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:48:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:29,520 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:29,521 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:29,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times
[2024-11-08 17:48:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:48:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906828084]
[2024-11-08 17:48:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:48:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:48:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:48:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:48:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 17:48:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 17:48:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:48:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2024-11-08 17:48:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:48:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906828084]
[2024-11-08 17:48:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906828084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:48:29,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:48:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:48:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063912510]
[2024-11-08 17:48:29,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:48:29,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:48:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:48:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:48:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:48:29,911 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-08 17:48:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:48:29,940 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions.
[2024-11-08 17:48:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:48:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49
[2024-11-08 17:48:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:48:29,953 INFO L225 Difference]: With dead ends: 65
[2024-11-08 17:48:29,954 INFO L226 Difference]: Without dead ends: 32
[2024-11-08 17:48:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-08 17:48:29,962 INFO L432 NwaCegarLoop]: 43 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, 43 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-08 17:48:29,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:48:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-08 17:48:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2024-11-08 17:48:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions.
[2024-11-08 17:48:30,020 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49
[2024-11-08 17:48:30,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:48:30,023 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions.
[2024-11-08 17:48:30,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-08 17:48:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions.
[2024-11-08 17:48:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:30,026 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:30,030 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:30,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:48:30,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:30,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:30,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times
[2024-11-08 17:48:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:48:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994470294]
[2024-11-08 17:48:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:48:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:48:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:48:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:48:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 17:48:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 17:48:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:48:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2024-11-08 17:48:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:48:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994470294]
[2024-11-08 17:48:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994470294] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:48:30,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:48:30,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:48:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118146682]
[2024-11-08 17:48:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:48:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:48:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:48:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:48:30,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:48:30,356 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 17:48:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:48:30,419 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions.
[2024-11-08 17:48:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:48:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49
[2024-11-08 17:48:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:48:30,425 INFO L225 Difference]: With dead ends: 72
[2024-11-08 17:48:30,425 INFO L226 Difference]: Without dead ends: 43
[2024-11-08 17:48:30,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-08 17:48:30,429 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:48:30,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:48:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2024-11-08 17:48:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34.
[2024-11-08 17:48:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions.
[2024-11-08 17:48:30,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49
[2024-11-08 17:48:30,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:48:30,451 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions.
[2024-11-08 17:48:30,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 17:48:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2024-11-08 17:48:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:30,456 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:30,456 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:30,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:48:30,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times
[2024-11-08 17:48:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:48:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080547501]
[2024-11-08 17:48:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:48:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:48:30,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:48:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:48:30,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:48:30,617 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:48:30,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 17:48:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:48:30,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2024-11-08 17:48:30,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:48:30,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:48:30 BoogieIcfgContainer
[2024-11-08 17:48:30,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:48:30,678 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:48:30,678 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:48:30,679 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:48:30,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:29" (3/4) ...
[2024-11-08 17:48:30,683 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:48:30,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:48:30,686 INFO L158 Benchmark]: Toolchain (without parser) took 2279.48ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 122.9MB in the beginning and 166.7MB in the end (delta: -43.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB.
[2024-11-08 17:48:30,687 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 157.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:48:30,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 109.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-08 17:48:30,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.17ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:48:30,691 INFO L158 Benchmark]: Boogie Preprocessor took 60.56ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:48:30,695 INFO L158 Benchmark]: RCFGBuilder took 466.40ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 92.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 17:48:30,696 INFO L158 Benchmark]: TraceAbstraction took 1293.99ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 92.0MB in the beginning and 167.8MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:48:30,697 INFO L158 Benchmark]: Witness Printer took 7.13ms. Allocated memory is still 216.0MB. Free memory was 167.8MB in the beginning and 166.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:48:30,703 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.33ms. Allocated memory is still 157.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 109.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 48.17ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.56ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 466.40ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 92.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 1293.99ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 92.0MB in the beginning and 167.8MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 7.13ms. Allocated memory is still 216.0MB. Free memory was 167.8MB in the beginning and 166.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 45.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] float var_1_1 = 0.6;
[L23] unsigned char var_1_2 = 0;
[L24] float var_1_3 = 0.0;
[L25] float var_1_4 = 2.95;
[L26] float var_1_5 = 8.5;
[L27] float var_1_6 = 999999999999.4;
[L28] double var_1_7 = 10.2;
[L29] double var_1_8 = 32.7;
[L30] double var_1_9 = 32.75;
[L31] double last_1_var_1_8 = 32.7;
VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L79] isInitial = 1
[L80] FCALL initially()
[L81] COND TRUE 1
[L82] CALL updateLastVariables()
[L72] last_1_var_1_8 = var_1_8
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L82] RET updateLastVariables()
[L83] CALL updateVariables()
[L59] var_1_2 = __VERIFIER_nondet_uchar()
[L60] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L60] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L61] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L61] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L62] var_1_3 = __VERIFIER_nondet_float()
[L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L64] var_1_4 = __VERIFIER_nondet_float()
[L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L66] var_1_5 = __VERIFIER_nondet_float()
[L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L68] var_1_6 = __VERIFIER_nondet_float()
[L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L83] RET updateVariables()
[L84] CALL step()
[L35] COND TRUE \read(var_1_2)
[L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4]
[L40] COND TRUE \read(var_1_2)
[L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4]
[L43] COND TRUE \read(var_1_2)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4]
[L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))
[L45] var_1_8 = (var_1_5 - var_1_3)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4]
[L54] COND TRUE var_1_4 != (var_1_3 - var_1_5)
[L55] var_1_9 = var_1_6
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004]
[L84] RET step()
[L85] CALL, EXPR property()
[L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1)
;
VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004]
[L85] RET, EXPR property()
[L85] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 85 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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-08 17:48:30,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX --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 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:48:33,527 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:48:33,660 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 17:48:33,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:48:33,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:48:33,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:48:33,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:48:33,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:48:33,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:48:33,718 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:48:33,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:48:33,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:48:33,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:48:33,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:48:33,721 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:48:33,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:48:33,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:48:33,723 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:48:33,723 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:48:33,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:48:33,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:48:33,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:48:33,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:48:33,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:48:33,728 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 17:48:33,728 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:48:33,729 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 17:48:33,729 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:48:33,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:48:33,730 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:48:33,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:48:33,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:48:33,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:48:33,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:48:33,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:48:33,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:48:33,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:48:33,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:48:33,733 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 17:48:33,734 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 17:48:33,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:48:33,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:48:33,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:48:33,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:48:33,735 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX
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 -> 9942167140f46cf9a6de342ca7e9162ccfb76997661e3494128a17b58a9424e7
[2024-11-08 17:48:34,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:48:34,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:48:34,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:48:34,330 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:48:34,331 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:48:34,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i
Unable to find full path for "g++"
[2024-11-08 17:48:36,623 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:48:36,934 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:48:36,934 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i
[2024-11-08 17:48:36,951 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/1696302e7/7e311f3925f4478194deea8cb3df790b/FLAG42d5b4d44
[2024-11-08 17:48:37,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/data/1696302e7/7e311f3925f4478194deea8cb3df790b
[2024-11-08 17:48:37,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:48:37,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:48:37,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:48:37,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:48:37,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:48:37,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccbe4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37, skipping insertion in model container
[2024-11-08 17:48:37,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,259 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:48:37,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928]
[2024-11-08 17:48:37,562 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:48:37,591 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:48:37,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-20.i[915,928]
[2024-11-08 17:48:37,628 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:48:37,651 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:48:37,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37 WrapperNode
[2024-11-08 17:48:37,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:48:37,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:48:37,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:48:37,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:48:37,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,706 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78
[2024-11-08 17:48:37,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:48:37,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:48:37,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:48:37,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:48:37,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,742 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 17:48:37,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:48:37,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:48:37,768 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:48:37,768 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:48:37,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (1/1) ...
[2024-11-08 17:48:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:48:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:48:37,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:48:37,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:48:37,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:48:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 17:48:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:48:37,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:48:37,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:48:37,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:48:37,966 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:48:37,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:48:46,712 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-08 17:48:46,713 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:48:46,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:48:46,730 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:48:46,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:46 BoogieIcfgContainer
[2024-11-08 17:48:46,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:48:46,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:48:46,734 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:48:46,736 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:48:46,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:48:37" (1/3) ...
[2024-11-08 17:48:46,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9a6613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:46, skipping insertion in model container
[2024-11-08 17:48:46,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:48:37" (2/3) ...
[2024-11-08 17:48:46,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9a6613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:48:46, skipping insertion in model container
[2024-11-08 17:48:46,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:48:46" (3/3) ...
[2024-11-08 17:48:46,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-20.i
[2024-11-08 17:48:46,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:48:46,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:48:46,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:48:46,868 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;@6550c155, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:48:46,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:48:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:46,888 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:46,889 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:46,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1762824234, now seen corresponding path program 1 times
[2024-11-08 17:48:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:48:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998902749]
[2024-11-08 17:48:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:46,913 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-08 17:48:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:48:46,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:46,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:47,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 17:48:47,475 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:48:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:48:47,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:48:47,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:48:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998902749]
[2024-11-08 17:48:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998902749] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:48:47,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:48:47,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:48:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668868377]
[2024-11-08 17:48:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:48:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:48:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:48:47,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:48:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:48:47,568 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-08 17:48:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:48:47,590 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions.
[2024-11-08 17:48:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:48:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49
[2024-11-08 17:48:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:48:47,600 INFO L225 Difference]: With dead ends: 65
[2024-11-08 17:48:47,601 INFO L226 Difference]: Without dead ends: 32
[2024-11-08 17:48:47,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-08 17:48:47,608 INFO L432 NwaCegarLoop]: 43 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, 43 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-08 17:48:47,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:48:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-08 17:48:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2024-11-08 17:48:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions.
[2024-11-08 17:48:47,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49
[2024-11-08 17:48:47,650 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:48:47,651 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions.
[2024-11-08 17:48:47,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2024-11-08 17:48:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions.
[2024-11-08 17:48:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:47,654 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:47,654 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:47,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:47,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:47,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:47,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1236900978, now seen corresponding path program 1 times
[2024-11-08 17:48:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:48:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893637495]
[2024-11-08 17:48:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:47,862 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-08 17:48:47,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:48:47,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:47,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:48:48,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:48:48,429 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:48:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2024-11-08 17:48:48,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:48:48,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:48:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893637495]
[2024-11-08 17:48:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893637495] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:48:48,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:48:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:48:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763306183]
[2024-11-08 17:48:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:48:48,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:48:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:48:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:48:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:48:48,520 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 17:48:50,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:48:54,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:48:59,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:48:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:48:59,068 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions.
[2024-11-08 17:48:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:48:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49
[2024-11-08 17:48:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:48:59,072 INFO L225 Difference]: With dead ends: 72
[2024-11-08 17:48:59,072 INFO L226 Difference]: Without dead ends: 43
[2024-11-08 17:48:59,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-08 17:48:59,075 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:48:59,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time]
[2024-11-08 17:48:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2024-11-08 17:48:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34.
[2024-11-08 17:48:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2024-11-08 17:48:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions.
[2024-11-08 17:48:59,092 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49
[2024-11-08 17:48:59,094 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:48:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions.
[2024-11-08 17:48:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 17:48:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2024-11-08 17:48:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-08 17:48:59,096 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:48:59,096 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:48:59,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-08 17:48:59,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:59,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:48:59,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:48:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1797194382, now seen corresponding path program 1 times
[2024-11-08 17:48:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:48:59,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447412014]
[2024-11-08 17:48:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:48:59,299 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-08 17:48:59,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:48:59,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:48:59,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd73fcc5-5725-4c79-b5a4-19654af23613/bin/uautomizer-verify-jihMAELWvX/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-08 17:49:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:49:00,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-08 17:49:00,066 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:49:18,712 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 17:49:25,435 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:49:31,570 WARN L286 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:49:39,670 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:49:45,899 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:49:56,159 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:03,808 WARN L286 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:16,276 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:21,914 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:29,153 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:36,191 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:41,434 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:47,132 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:50:52,436 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:51:04,800 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:53:36,337 WARN L286 SmtUtils]: Spent 1.70m on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 17:53:44,546 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:53:51,841 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:53:58,178 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:06,305 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:14,290 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:22,406 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:34,189 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:42,359 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:50,055 WARN L286 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:54:58,200 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:06,312 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:14,515 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:20,104 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:28,252 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:36,371 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:44,498 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:55:52,761 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:00,976 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:09,209 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:17,375 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:25,570 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:33,769 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:41,938 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:50,109 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:56:58,298 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:06,450 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:14,616 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:22,780 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:30,954 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:39,150 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:47,357 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:57:55,517 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:03,734 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:11,919 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:20,091 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:28,243 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:36,390 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:44,517 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:58:48,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0))) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0))))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 17:58:59,795 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:07,973 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:16,125 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:24,296 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:32,447 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:40,646 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:48,883 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:59:57,038 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:05,246 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:13,426 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:21,602 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:29,770 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:37,926 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:46,113 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:00:54,296 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:02,453 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:10,680 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:18,845 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:27,014 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:35,217 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:43,370 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:51,528 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:01:59,688 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:02:03,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 18:02:07,783 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.leq c_~var_1_5~0 .cse0) (fp.leq c_~var_1_3~0 .cse0) (fp.geq c_~var_1_3~0 .cse1) (or (and (fp.geq c_~var_1_6~0 .cse1) (fp.leq c_~var_1_6~0 .cse2)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse2)) (fp.leq c_~var_1_6~0 (fp.neg .cse1)))) (= c_~var_1_9~0 .cse3) (let ((.cse4 (fp.gt c_~last_1_var_1_8~0 .cse3))) (or (and (fp.geq c_~var_1_7~0 .cse3) (not .cse4)) (and .cse4 (fp.geq c_~var_1_7~0 c_~last_1_var_1_8~0)))) (fp.leq c_~var_1_4~0 .cse2) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0)) (fp.geq c_~var_1_4~0 .cse1) (= c_~var_1_8~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_5~0 c_~var_1_3~0))) (let ((.cse8 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 255719.0 1000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 23.0 10.0))) (.cse5 (fp.lt .cse8 .cse6))) (or (and (not .cse5) (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse6 .cse7))) (and (= c_~var_1_7~0 (fp.sub c_currentRoundingMode .cse8 .cse7)) .cse5)))) (fp.geq c_~var_1_5~0 .cse1) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true