./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.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_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/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 d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:54:09,835 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:54:10,011 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 17:54:10,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:54:10,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:54:10,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:54:10,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:54:10,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:54:10,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:54:10,072 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:54:10,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:54:10,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:54:10,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:54:10,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:54:10,076 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:54:10,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:54:10,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:54:10,081 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:54:10,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:54:10,082 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:54:10,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:54:10,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:54:10,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:54:10,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:54:10,089 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:54:10,089 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:54:10,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:54:10,090 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:54:10,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:54:10,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:54:10,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:54:10,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:54:10,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:54:10,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:54:10,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:54:10,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:54:10,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:54:10,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:54:10,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:54:10,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:54:10,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:54:10,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:54:10,099 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_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/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 -> d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144
[2024-11-08 17:54:10,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:54:10,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:54:10,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:54:10,577 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:54:10,577 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:54:10,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i
Unable to find full path for "g++"
[2024-11-08 17:54:12,779 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:54:13,057 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:54:13,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i
[2024-11-08 17:54:13,077 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/c68f364b4/7662ac57a1c745dfb2e6bf18a79b951f/FLAGf85a6d5b3
[2024-11-08 17:54:13,101 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/c68f364b4/7662ac57a1c745dfb2e6bf18a79b951f
[2024-11-08 17:54:13,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:54:13,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:54:13,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:54:13,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:54:13,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:54:13,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10536a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13, skipping insertion in model container
[2024-11-08 17:54:13,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,146 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:54:13,335 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_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i[915,928]
[2024-11-08 17:54:13,444 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:54:13,461 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:54:13,475 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_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i[915,928]
[2024-11-08 17:54:13,533 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:54:13,564 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:54:13,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13 WrapperNode
[2024-11-08 17:54:13,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:54:13,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:54:13,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:54:13,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:54:13,576 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:54:13" (1/1) ...
[2024-11-08 17:54:13,589 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:54:13" (1/1) ...
[2024-11-08 17:54:13,641 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204
[2024-11-08 17:54:13,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:54:13,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:54:13,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:54:13,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:54:13,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,686 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:54:13,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:54:13,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:54:13,724 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:54:13,724 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:54:13,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (1/1) ...
[2024-11-08 17:54:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:54:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:54:13,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:13,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:54:13,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:54:13,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:54:13,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:54:13,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:54:13,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:54:14,009 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:54:14,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:54:14,526 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-11-08 17:54:14,526 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:54:14,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:54:14,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:54:14,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:14 BoogieIcfgContainer
[2024-11-08 17:54:14,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:54:14,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:54:14,557 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:54:14,561 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:54:14,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:54:13" (1/3) ...
[2024-11-08 17:54:14,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af6364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:14, skipping insertion in model container
[2024-11-08 17:54:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:13" (2/3) ...
[2024-11-08 17:54:14,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af6364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:14, skipping insertion in model container
[2024-11-08 17:54:14,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:14" (3/3) ...
[2024-11-08 17:54:14,565 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-6.i
[2024-11-08 17:54:14,585 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:54:14,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:54:14,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:54:14,678 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;@591e6d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:54:14,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:54:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-08 17:54:14,707 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:14,708 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1432095947, now seen corresponding path program 1 times
[2024-11-08 17:54:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225783543]
[2024-11-08 17:54:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:54:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:54:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:54:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:54:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:54:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:54:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:54:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 17:54:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 17:54:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 17:54:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:54:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 17:54:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 17:54:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 17:54:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 17:54:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 17:54:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 17:54:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 17:54:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 17:54:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 17:54:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-08 17:54:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2024-11-08 17:54:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-08 17:54:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-08 17:54:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:54:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225783543]
[2024-11-08 17:54:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225783543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:54:15,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:54:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:54:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927010991]
[2024-11-08 17:54:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:54:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:54:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:54:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:54:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:54:15,328 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:54:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:15,361 INFO L93 Difference]: Finished difference Result 174 states and 297 transitions.
[2024-11-08 17:54:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:54:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153
[2024-11-08 17:54:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:15,374 INFO L225 Difference]: With dead ends: 174
[2024-11-08 17:54:15,374 INFO L226 Difference]: Without dead ends: 86
[2024-11-08 17:54:15,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:54:15,383 INFO L432 NwaCegarLoop]: 131 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, 131 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:54:15,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:54:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2024-11-08 17:54:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2024-11-08 17:54:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions.
[2024-11-08 17:54:15,454 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 153
[2024-11-08 17:54:15,454 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:15,454 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions.
[2024-11-08 17:54:15,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:54:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions.
[2024-11-08 17:54:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-08 17:54:15,462 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:15,463 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:15,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:54:15,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:15,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash 110553711, now seen corresponding path program 1 times
[2024-11-08 17:54:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051017340]
[2024-11-08 17:54:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:54:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:54:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:54:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:54:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:54:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:54:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:54:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 17:54:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 17:54:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 17:54:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:54:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 17:54:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 17:54:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 17:54:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 17:54:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 17:54:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 17:54:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 17:54:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 17:54:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 17:54:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-08 17:54:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2024-11-08 17:54:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-08 17:54:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked.
[2024-11-08 17:54:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:54:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051017340]
[2024-11-08 17:54:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051017340] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:54:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79727470]
[2024-11-08 17:54:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:54:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:54:18,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:54:18,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 17:54:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:18,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-08 17:54:18,338 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:54:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2024-11-08 17:54:18,910 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:54:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked.
[2024-11-08 17:54:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79727470] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:54:19,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:54:19,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28
[2024-11-08 17:54:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137412843]
[2024-11-08 17:54:19,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:54:19,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-11-08 17:54:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:54:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-11-08 17:54:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756
[2024-11-08 17:54:19,903 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39)
[2024-11-08 17:54:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:25,667 INFO L93 Difference]: Finished difference Result 437 states and 609 transitions.
[2024-11-08 17:54:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states.
[2024-11-08 17:54:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39) Word has length 153
[2024-11-08 17:54:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:25,673 INFO L225 Difference]: With dead ends: 437
[2024-11-08 17:54:25,673 INFO L226 Difference]: Without dead ends: 354
[2024-11-08 17:54:25,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2015, Invalid=7491, Unknown=0, NotChecked=0, Total=9506
[2024-11-08 17:54:25,679 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1131 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:54:25,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 809 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-08 17:54:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2024-11-08 17:54:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 111.
[2024-11-08 17:54:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions.
[2024-11-08 17:54:25,726 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 153
[2024-11-08 17:54:25,727 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:25,727 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions.
[2024-11-08 17:54:25,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 8 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 7 states have call predecessors, (39), 8 states have call successors, (39)
[2024-11-08 17:54:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions.
[2024-11-08 17:54:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-11-08 17:54:25,730 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:25,731 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:25,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 17:54:25,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:54:25,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:25,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash 808446243, now seen corresponding path program 1 times
[2024-11-08 17:54:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077805312]
[2024-11-08 17:54:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:54:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:54:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:54:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:54:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:54:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:54:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:54:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 17:54:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 17:54:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 17:54:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:54:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 17:54:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 17:54:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 17:54:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 17:54:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 17:54:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 17:54:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 17:54:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 17:54:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 17:54:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-08 17:54:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2024-11-08 17:54:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-08 17:54:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-08 17:54:26,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:54:26,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077805312]
[2024-11-08 17:54:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077805312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:54:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:54:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:54:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427121509]
[2024-11-08 17:54:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:54:26,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:54:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:54:26,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:54:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:54:26,137 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:54:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:26,202 INFO L93 Difference]: Finished difference Result 261 states and 374 transitions.
[2024-11-08 17:54:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:54:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154
[2024-11-08 17:54:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:26,208 INFO L225 Difference]: With dead ends: 261
[2024-11-08 17:54:26,211 INFO L226 Difference]: Without dead ends: 153
[2024-11-08 17:54:26,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:54:26,213 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:54:26,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 237 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:54:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2024-11-08 17:54:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136.
[2024-11-08 17:54:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 107 states have internal predecessors, (150), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions.
[2024-11-08 17:54:26,258 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 154
[2024-11-08 17:54:26,259 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:26,259 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions.
[2024-11-08 17:54:26,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:54:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions.
[2024-11-08 17:54:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-11-08 17:54:26,266 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:26,266 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:54:26,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:26,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1471106381, now seen corresponding path program 1 times
[2024-11-08 17:54:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92095894]
[2024-11-08 17:54:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:54:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:54:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:54:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:54:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:54:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:54:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:54:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 17:54:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 17:54:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 17:54:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:54:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 17:54:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 17:54:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 17:54:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 17:54:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 17:54:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 17:54:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 17:54:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 17:54:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 17:54:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-08 17:54:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2024-11-08 17:54:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-08 17:54:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-08 17:54:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:54:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92095894]
[2024-11-08 17:54:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92095894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:54:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:54:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:54:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954814772]
[2024-11-08 17:54:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:54:26,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:54:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:54:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:54:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:54:26,478 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:54:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:26,560 INFO L93 Difference]: Finished difference Result 326 states and 471 transitions.
[2024-11-08 17:54:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:54:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154
[2024-11-08 17:54:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:26,565 INFO L225 Difference]: With dead ends: 326
[2024-11-08 17:54:26,567 INFO L226 Difference]: Without dead ends: 193
[2024-11-08 17:54:26,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:54:26,572 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:54:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 270 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:54:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2024-11-08 17:54:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190.
[2024-11-08 17:54:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.4050632911392404) internal successors, (222), 159 states have internal predecessors, (222), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-08 17:54:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 272 transitions.
[2024-11-08 17:54:26,627 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 272 transitions. Word has length 154
[2024-11-08 17:54:26,628 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:26,628 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 272 transitions.
[2024-11-08 17:54:26,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:54:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 272 transitions.
[2024-11-08 17:54:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-11-08 17:54:26,637 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:26,637 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:54:26,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1235513013, now seen corresponding path program 1 times
[2024-11-08 17:54:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234948641]
[2024-11-08 17:54:26,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 17:54:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 17:54:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:54:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:54:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:54:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 17:54:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 17:54:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 17:54:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-08 17:54:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-08 17:54:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:54:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 17:54:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72
[2024-11-08 17:54:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-08 17:54:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 17:54:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-08 17:54:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2024-11-08 17:54:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2024-11-08 17:54:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2024-11-08 17:54:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111
[2024-11-08 17:54:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-08 17:54:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122
[2024-11-08 17:54:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127
[2024-11-08 17:54:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-08 17:54:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:54:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234948641]
[2024-11-08 17:54:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234948641] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:54:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555836924]
[2024-11-08 17:54:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:27,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:54:27,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:54:27,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:54:27,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 17:54:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:27,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:54:27,588 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:54:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked.
[2024-11-08 17:54:27,917 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:54:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-08 17:54:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555836924] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:54:28,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:54:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10
[2024-11-08 17:54:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070817400]
[2024-11-08 17:54:28,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:54:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 17:54:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:54:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 17:54:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:54:28,228 INFO L87 Difference]: Start difference. First operand 190 states and 272 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60)
[2024-11-08 17:54:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:28,481 INFO L93 Difference]: Finished difference Result 369 states and 520 transitions.
[2024-11-08 17:54:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:54:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 154
[2024-11-08 17:54:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:28,486 INFO L225 Difference]: With dead ends: 369
[2024-11-08 17:54:28,486 INFO L226 Difference]: Without dead ends: 182
[2024-11-08 17:54:28,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156
[2024-11-08 17:54:28,487 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 173 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:54:28,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 243 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:54:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2024-11-08 17:54:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176.
[2024-11-08 17:54:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3496503496503496) internal successors, (193), 144 states have internal predecessors, (193), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-08 17:54:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions.
[2024-11-08 17:54:28,515 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 154
[2024-11-08 17:54:28,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:28,515 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions.
[2024-11-08 17:54:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60)
[2024-11-08 17:54:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions.
[2024-11-08 17:54:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-11-08 17:54:28,518 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:28,518 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 17:54:28,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:54:28,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:28,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1883657778, now seen corresponding path program 1 times
[2024-11-08 17:54:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:54:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67896822]
[2024-11-08 17:54:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:54:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:54:28,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:54:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:54:29,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:54:29,014 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:54:29,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 17:54:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 17:54:29,022 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-08 17:54:29,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:54:29,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:54:29 BoogieIcfgContainer
[2024-11-08 17:54:29,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:54:29,196 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:54:29,196 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:54:29,196 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:54:29,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:14" (3/4) ...
[2024-11-08 17:54:29,202 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:54:29,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:54:29,205 INFO L158 Benchmark]: Toolchain (without parser) took 16100.06ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 147.2MB in the beginning and 211.0MB in the end (delta: -63.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,205 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:54:29,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.37ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 129.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.95ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 124.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,206 INFO L158 Benchmark]: Boogie Preprocessor took 80.06ms. Allocated memory is still 176.2MB. Free memory was 124.2MB in the beginning and 115.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,206 INFO L158 Benchmark]: RCFGBuilder took 829.90ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 116.3MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,207 INFO L158 Benchmark]: TraceAbstraction took 14638.18ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 115.4MB in the beginning and 211.0MB in the end (delta: -95.6MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB.
[2024-11-08 17:54:29,207 INFO L158 Benchmark]: Witness Printer took 8.42ms. Allocated memory is still 255.9MB. Free memory is still 211.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:54:29,213 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.44ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 459.37ms. Allocated memory is still 176.2MB. Free memory was 147.2MB in the beginning and 129.2MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 75.95ms. Allocated memory is still 176.2MB. Free memory was 129.2MB in the beginning and 124.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 80.06ms. Allocated memory is still 176.2MB. Free memory was 124.2MB in the beginning and 115.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 829.90ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 116.3MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 14638.18ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 115.4MB in the beginning and 211.0MB in the end (delta: -95.6MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB.
* Witness Printer took 8.42ms. Allocated memory is still 255.9MB. Free memory is still 211.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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 2;
[L23] unsigned char var_1_2 = 1;
[L24] unsigned char var_1_3 = 0;
[L25] unsigned short int var_1_5 = 34011;
[L26] unsigned short int var_1_6 = 2;
[L27] signed short int var_1_7 = -4;
[L28] signed long int var_1_9 = -4;
[L29] unsigned short int var_1_10 = 4;
[L30] double var_1_12 = 1.8;
[L31] double var_1_13 = 49.5;
[L32] double var_1_14 = 0.0;
[L33] double var_1_15 = 8.5;
[L34] unsigned long int var_1_16 = 4;
[L35] float var_1_17 = 3.65;
[L36] unsigned char var_1_18 = 0;
[L37] signed long int var_1_19 = 32;
[L38] signed long int var_1_20 = 1000000000;
[L39] signed long int var_1_21 = 1141305717;
[L40] unsigned char var_1_22 = 50;
[L41] unsigned char var_1_23 = 0;
[L42] unsigned short int var_1_24 = 2;
[L43] signed short int var_1_25 = -16;
[L44] double var_1_26 = 15.6;
[L45] double var_1_27 = 4.25;
[L46] unsigned long int var_1_28 = 10;
[L47] unsigned char last_1_var_1_22 = 50;
VAL [isInitial=0, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L183] isInitial = 1
[L184] FCALL initially()
[L185] COND TRUE 1
[L186] CALL updateLastVariables()
[L176] last_1_var_1_22 = var_1_22
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L186] RET updateLastVariables()
[L187] CALL updateVariables()
[L138] var_1_2 = __VERIFIER_nondet_uchar()
[L139] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L139] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L140] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L140] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L141] var_1_3 = __VERIFIER_nondet_uchar()
[L142] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L142] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L143] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L143] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L144] var_1_5 = __VERIFIER_nondet_ushort()
[L145] CALL assume_abort_if_not(var_1_5 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L145] RET assume_abort_if_not(var_1_5 >= 32767)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L146] CALL assume_abort_if_not(var_1_5 <= 65534)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L146] RET assume_abort_if_not(var_1_5 <= 65534)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4]
[L147] var_1_6 = __VERIFIER_nondet_ushort()
[L148] CALL assume_abort_if_not(var_1_6 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4]
[L148] RET assume_abort_if_not(var_1_6 >= 0)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4]
[L149] CALL assume_abort_if_not(var_1_6 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L149] RET assume_abort_if_not(var_1_6 <= 32767)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L150] var_1_13 = __VERIFIER_nondet_double()
[L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L152] var_1_14 = __VERIFIER_nondet_double()
[L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L154] var_1_15 = __VERIFIER_nondet_double()
[L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L156] var_1_18 = __VERIFIER_nondet_uchar()
[L157] CALL assume_abort_if_not(var_1_18 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L157] RET assume_abort_if_not(var_1_18 >= 0)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L158] CALL assume_abort_if_not(var_1_18 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L158] RET assume_abort_if_not(var_1_18 <= 1)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L159] var_1_20 = __VERIFIER_nondet_long()
[L160] CALL assume_abort_if_not(var_1_20 >= 536870911)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L160] RET assume_abort_if_not(var_1_20 >= 536870911)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L161] CALL assume_abort_if_not(var_1_20 <= 1073741823)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L161] RET assume_abort_if_not(var_1_20 <= 1073741823)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L162] var_1_21 = __VERIFIER_nondet_long()
[L163] CALL assume_abort_if_not(var_1_21 >= 1073741822)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L163] RET assume_abort_if_not(var_1_21 >= 1073741822)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L164] CALL assume_abort_if_not(var_1_21 <= 2147483646)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L164] RET assume_abort_if_not(var_1_21 <= 2147483646)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L165] var_1_23 = __VERIFIER_nondet_uchar()
[L166] CALL assume_abort_if_not(var_1_23 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L166] RET assume_abort_if_not(var_1_23 >= 0)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L167] CALL assume_abort_if_not(var_1_23 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L167] RET assume_abort_if_not(var_1_23 <= 254)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L168] var_1_26 = __VERIFIER_nondet_double()
[L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L170] CALL assume_abort_if_not(var_1_26 != 0.0F)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L170] RET assume_abort_if_not(var_1_26 != 0.0F)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L171] var_1_27 = __VERIFIER_nondet_double()
[L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L173] CALL assume_abort_if_not(var_1_27 != 0.0F)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L173] RET assume_abort_if_not(var_1_27 != 0.0F)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4]
[L187] RET updateVariables()
[L188] CALL step()
[L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)
[L52] unsigned char stepLocal_2 = var_1_18;
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0]
[L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))
[L54] var_1_22 = var_1_23
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0]
[L58] COND TRUE var_1_2 || var_1_3
[L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0]
[L63] COND FALSE !(var_1_22 <= (- 500))
[L68] var_1_7 = var_1_22
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L70] var_1_10 = (var_1_5 - (var_1_22 + 1000))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L71] COND FALSE !(! var_1_3)
[L74] var_1_12 = (var_1_14 - var_1_13)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L76] unsigned char stepLocal_0 = var_1_22;
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L77] COND FALSE !(\read(var_1_2))
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0
[L81] var_1_16 = 128u
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L86] COND TRUE \read(var_1_18)
[L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L99] var_1_28 = var_1_21
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L100] COND TRUE ! ((! var_1_3) && var_1_18)
[L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28)))
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L107] unsigned short int stepLocal_4 = var_1_24;
[L108] unsigned short int stepLocal_3 = var_1_10;
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15)
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L122] unsigned char stepLocal_1 = var_1_22;
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=254, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L123] COND TRUE var_1_24 >= stepLocal_1
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L124] COND TRUE ! var_1_2
[L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5)))
VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L188] RET step()
[L189] CALL, EXPR property()
[L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21))
;
[L189] RET, EXPR property()
[L189] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1407 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1403 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1056 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 634 mSDtfsCounter, 1321 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 978 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 269 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 3602 SizeOfPredicates, 11 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8841/9108 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:54:29,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
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_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/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 d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:54:32,333 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:54:32,425 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 17:54:32,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:54:32,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:54:32,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:54:32,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:54:32,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:54:32,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:54:32,490 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:54:32,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:54:32,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:54:32,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:54:32,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:54:32,495 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:54:32,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:54:32,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:54:32,497 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:54:32,497 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:54:32,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:54:32,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:54:32,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:54:32,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:54:32,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:54:32,504 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 17:54:32,504 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:54:32,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 17:54:32,506 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:54:32,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:54:32,509 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:54:32,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:54:32,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:54:32,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:54:32,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:54:32,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:54:32,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:54:32,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:54:32,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:54:32,514 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 17:54:32,514 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 17:54:32,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:54:32,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:54:32,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:54:32,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:54:32,516 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_a03ca90c-16e2-47f5-8b40-3086468b343c/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_a03ca90c-16e2-47f5-8b40-3086468b343c/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 -> d7eabdbab374be563cd8848c2ea71ab0b8442a8d3524e27c1a68fc35b28e5144
[2024-11-08 17:54:32,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:54:32,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:54:33,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:54:33,002 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:54:33,003 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:54:33,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i
Unable to find full path for "g++"
[2024-11-08 17:54:35,403 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:54:35,807 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:54:35,812 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i
[2024-11-08 17:54:35,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/5f972fd1d/7cd851ce47154093adc7d36d1dfc9bf1/FLAG88b3bca4c
[2024-11-08 17:54:35,857 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/data/5f972fd1d/7cd851ce47154093adc7d36d1dfc9bf1
[2024-11-08 17:54:35,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:54:35,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:54:35,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:54:35,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:54:35,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:54:35,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:35" (1/1) ...
[2024-11-08 17:54:35,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420ea5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:35, skipping insertion in model container
[2024-11-08 17:54:35,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:35" (1/1) ...
[2024-11-08 17:54:35,942 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:54:36,243 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_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i[915,928]
[2024-11-08 17:54:36,400 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:54:36,434 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:54:36,458 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_a03ca90c-16e2-47f5-8b40-3086468b343c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-6.i[915,928]
[2024-11-08 17:54:36,535 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:54:36,579 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:54:36,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36 WrapperNode
[2024-11-08 17:54:36,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:54:36,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:54:36,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:54:36,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:54:36,600 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:54:36" (1/1) ...
[2024-11-08 17:54:36,634 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:54:36" (1/1) ...
[2024-11-08 17:54:36,704 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173
[2024-11-08 17:54:36,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:54:36,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:54:36,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:54:36,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:54:36,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,767 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:54:36,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:54:36,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:54:36,817 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:54:36,817 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:54:36,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (1/1) ...
[2024-11-08 17:54:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:54:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:54:36,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:36,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:54:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 17:54:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:54:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:54:36,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:54:36,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:54:37,027 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:54:37,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:54:53,996 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-08 17:54:53,996 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:54:54,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:54:54,021 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 17:54:54,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:54 BoogieIcfgContainer
[2024-11-08 17:54:54,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:54:54,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:54:54,027 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:54:54,031 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:54:54,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:54:35" (1/3) ...
[2024-11-08 17:54:54,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e01c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:54, skipping insertion in model container
[2024-11-08 17:54:54,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:36" (2/3) ...
[2024-11-08 17:54:54,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e01c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:54, skipping insertion in model container
[2024-11-08 17:54:54,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:54" (3/3) ...
[2024-11-08 17:54:54,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-6.i
[2024-11-08 17:54:54,059 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:54:54,060 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:54:54,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:54:54,146 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;@4b8b9752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:54:54,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:54:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2024-11-08 17:54:54,172 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:54,173 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1829847039, now seen corresponding path program 1 times
[2024-11-08 17:54:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:54:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273173494]
[2024-11-08 17:54:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:54,203 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:54:54,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:54:54,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:54,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:56,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 17:54:56,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:54:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked.
[2024-11-08 17:54:56,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:54:56,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:54:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273173494]
[2024-11-08 17:54:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273173494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:54:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:54:56,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:54:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527810903]
[2024-11-08 17:54:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:54:56,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:54:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:54:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:54:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:54:56,701 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:54:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:54:56,769 INFO L93 Difference]: Finished difference Result 152 states and 265 transitions.
[2024-11-08 17:54:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:54:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151
[2024-11-08 17:54:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:54:56,782 INFO L225 Difference]: With dead ends: 152
[2024-11-08 17:54:56,783 INFO L226 Difference]: Without dead ends: 75
[2024-11-08 17:54:56,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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:54:56,796 INFO L432 NwaCegarLoop]: 115 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, 115 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:54:56,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:54:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2024-11-08 17:54:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2024-11-08 17:54:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:54:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions.
[2024-11-08 17:54:56,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 151
[2024-11-08 17:54:56,869 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:54:56,870 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions.
[2024-11-08 17:54:56,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:54:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions.
[2024-11-08 17:54:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2024-11-08 17:54:56,876 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:54:56,877 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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)] Forceful destruction successful, exit code 0
[2024-11-08 17:54:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:57,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:54:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:54:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1846755911, now seen corresponding path program 1 times
[2024-11-08 17:54:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:54:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906591486]
[2024-11-08 17:54:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:54:57,086 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:54:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:54:57,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:57,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:54:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:54:59,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 17:54:59,250 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:55:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked.
[2024-11-08 17:55:01,948 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:55:04,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:55:04,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906591486]
[2024-11-08 17:55:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906591486] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:55:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657593647]
[2024-11-08 17:55:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:55:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:55:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:55:04,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:55:04,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 17:55:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:55:08,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 17:55:08,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:55:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked.
[2024-11-08 17:55:09,591 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:55:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657593647] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:55:10,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 17:55:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9
[2024-11-08 17:55:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872860528]
[2024-11-08 17:55:10,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:55:10,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:55:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:55:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:55:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2024-11-08 17:55:10,505 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:55:19,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 17:55:23,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 17:55:27,866 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 [0]
[2024-11-08 17:55:31,874 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 [0]
[2024-11-08 17:55:36,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:55:40,396 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:55:44,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-08 17:55:48,412 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:55:52,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:55:56,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:56:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:56:02,238 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions.
[2024-11-08 17:56:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-08 17:56:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151
[2024-11-08 17:56:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:56:02,247 INFO L225 Difference]: With dead ends: 278
[2024-11-08 17:56:02,248 INFO L226 Difference]: Without dead ends: 206
[2024-11-08 17:56:02,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870
[2024-11-08 17:56:02,251 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 254 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 143 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:56:02,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 600 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 468 Invalid, 10 Unknown, 0 Unchecked, 48.2s Time]
[2024-11-08 17:56:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2024-11-08 17:56:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 86.
[2024-11-08 17:56:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:56:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions.
[2024-11-08 17:56:02,299 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 151
[2024-11-08 17:56:02,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:56:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions.
[2024-11-08 17:56:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:56:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions.
[2024-11-08 17:56:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-08 17:56:02,304 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:56:02,305 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 17:56:02,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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)] Ended with exit code 0
[2024-11-08 17:56:02,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:02,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:56:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:56:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1975497988, now seen corresponding path program 1 times
[2024-11-08 17:56:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:56:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052473629]
[2024-11-08 17:56:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:56:02,709 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:56:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:56:02,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:02,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (5)] Waiting until timeout for monitored process
[2024-11-08 17:56:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:56:04,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:56:04,507 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:56:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-08 17:56:04,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:56:04,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:56:04,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052473629]
[2024-11-08 17:56:04,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052473629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:56:04,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:56:04,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:56:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403244352]
[2024-11-08 17:56:04,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:56:04,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:56:04,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:56:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:56:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:56:04,813 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:56:09,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:56:14,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:56:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:56:14,384 INFO L93 Difference]: Finished difference Result 198 states and 299 transitions.
[2024-11-08 17:56:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:56:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152
[2024-11-08 17:56:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:56:14,528 INFO L225 Difference]: With dead ends: 198
[2024-11-08 17:56:14,528 INFO L226 Difference]: Without dead ends: 115
[2024-11-08 17:56:14,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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:56:14,535 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 28 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:56:14,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time]
[2024-11-08 17:56:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2024-11-08 17:56:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107.
[2024-11-08 17:56:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-08 17:56:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions.
[2024-11-08 17:56:14,564 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 152
[2024-11-08 17:56:14,565 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:56:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions.
[2024-11-08 17:56:14,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:56:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions.
[2024-11-08 17:56:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-08 17:56:14,570 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:56:14,570 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (5)] Ended with exit code 0
[2024-11-08 17:56:14,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:14,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:56:14,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:56:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -286856257, now seen corresponding path program 1 times
[2024-11-08 17:56:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:56:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771134502]
[2024-11-08 17:56:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:56:14,774 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:56:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:56:14,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:14,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (6)] Waiting until timeout for monitored process
[2024-11-08 17:56:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:56:16,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:56:16,630 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:56:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-08 17:56:16,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:56:16,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:56:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771134502]
[2024-11-08 17:56:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771134502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:56:16,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:56:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:56:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831351453]
[2024-11-08 17:56:16,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:56:16,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:56:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:56:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:56:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:56:16,892 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:56:19,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:56:24,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:56:28,747 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:56:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:56:28,916 INFO L93 Difference]: Finished difference Result 255 states and 384 transitions.
[2024-11-08 17:56:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:56:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152
[2024-11-08 17:56:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:56:28,921 INFO L225 Difference]: With dead ends: 255
[2024-11-08 17:56:28,921 INFO L226 Difference]: Without dead ends: 151
[2024-11-08 17:56:28,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:56:28,924 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 39 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:56:28,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 224 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time]
[2024-11-08 17:56:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2024-11-08 17:56:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148.
[2024-11-08 17:56:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 120 states have internal predecessors, (169), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-08 17:56:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions.
[2024-11-08 17:56:28,967 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 152
[2024-11-08 17:56:28,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:56:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions.
[2024-11-08 17:56:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-08 17:56:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions.
[2024-11-08 17:56:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-08 17:56:28,972 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:56:28,973 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (6)] Forceful destruction successful, exit code 0
[2024-11-08 17:56:29,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:29,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:56:29,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:56:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 993007421, now seen corresponding path program 1 times
[2024-11-08 17:56:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:56:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089680891]
[2024-11-08 17:56:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:56:29,178 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:56:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:56:29,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:56:29,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (7)] Waiting until timeout for monitored process
[2024-11-08 17:56:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:56:30,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:56:30,958 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:56:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked.
[2024-11-08 17:56:34,404 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:56:35,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:56:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089680891]
[2024-11-08 17:56:35,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089680891] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:56:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57788688]
[2024-11-08 17:56:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:56:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:56:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:56:35,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:56:35,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 17:56:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:56:47,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:56:47,116 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:56:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked.
[2024-11-08 17:56:50,379 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:56:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57788688] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:56:50,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 17:56:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5
[2024-11-08 17:56:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750186514]
[2024-11-08 17:56:50,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:56:50,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:56:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:56:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:56:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:56:50,963 INFO L87 Difference]: Start difference. First operand 148 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:56:57,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:57:01,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:57:05,986 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:57:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:57:05,994 INFO L93 Difference]: Finished difference Result 287 states and 418 transitions.
[2024-11-08 17:57:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 17:57:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152
[2024-11-08 17:57:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:57:06,185 INFO L225 Difference]: With dead ends: 287
[2024-11-08 17:57:06,185 INFO L226 Difference]: Without dead ends: 142
[2024-11-08 17:57:06,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:57:06,188 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time
[2024-11-08 17:57:06,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 198 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time]
[2024-11-08 17:57:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2024-11-08 17:57:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138.
[2024-11-08 17:57:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 109 states have internal predecessors, (146), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25)
[2024-11-08 17:57:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions.
[2024-11-08 17:57:06,222 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 152
[2024-11-08 17:57:06,223 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:57:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions.
[2024-11-08 17:57:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-08 17:57:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions.
[2024-11-08 17:57:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-08 17:57:06,228 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:57:06,228 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:06,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-08 17:57:06,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (7)] Forceful destruction successful, exit code 0
[2024-11-08 17:57:06,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:57:06,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:57:06,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:57:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash -279772225, now seen corresponding path program 1 times
[2024-11-08 17:57:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:57:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893075860]
[2024-11-08 17:57:06,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:57:06,633 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:57:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:57:06,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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:57:06,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a03ca90c-16e2-47f5-8b40-3086468b343c/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 (9)] Waiting until timeout for monitored process
[2024-11-08 17:57:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:57:08,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-11-08 17:57:08,805 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:57:47,263 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 17:58:09,043 WARN L286 SmtUtils]: Spent 5.34s 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:58:17,153 WARN L286 SmtUtils]: Spent 8.08s 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:24,115 WARN L286 SmtUtils]: Spent 6.96s 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:40,685 WARN L286 SmtUtils]: Spent 7.65s 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:46,622 WARN L286 SmtUtils]: Spent 5.94s 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:57,094 WARN L286 SmtUtils]: Spent 7.79s 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:05,259 WARN L286 SmtUtils]: Spent 8.16s 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:11,185 WARN L286 SmtUtils]: Spent 5.92s 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:17,832 WARN L286 SmtUtils]: Spent 6.65s 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:26,031 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:33,738 WARN L286 SmtUtils]: Spent 7.71s 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:59:39,595 WARN L286 SmtUtils]: Spent 5.86s 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:59:47,828 WARN L286 SmtUtils]: Spent 8.23s 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:55,987 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 18:00:03,815 WARN L286 SmtUtils]: Spent 7.83s 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:00:11,972 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:00:18,150 WARN L286 SmtUtils]: Spent 6.18s 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:04:12,782 WARN L286 SmtUtils]: Spent 2.33m on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 18:04:20,954 WARN L286 SmtUtils]: Spent 8.14s 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:04:28,650 WARN L286 SmtUtils]: Spent 7.69s 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:04:36,793 WARN L286 SmtUtils]: Spent 8.14s 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:04:44,896 WARN L286 SmtUtils]: Spent 8.10s 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:04:52,207 WARN L286 SmtUtils]: Spent 7.31s 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:05:00,259 WARN L286 SmtUtils]: Spent 8.05s 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:05:10,871 WARN L286 SmtUtils]: Spent 7.16s 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:05:17,605 WARN L286 SmtUtils]: Spent 6.73s 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:05:22,877 WARN L286 SmtUtils]: Spent 5.27s 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:05:31,054 WARN L286 SmtUtils]: Spent 8.18s 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:05:37,580 WARN L286 SmtUtils]: Spent 6.53s 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:05:50,260 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 18:05:59,946 WARN L286 SmtUtils]: Spent 5.68s 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:06:11,697 WARN L286 SmtUtils]: Spent 8.14s 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:06:24,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_22~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)))) (and (not (= (_ bv0 8) c_~var_1_18~0)) (= c_~var_1_1~0 ((_ extract 15 0) .cse0)) (= (fp.sub c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0) c_~var_1_12~0) (= c_~var_1_21~0 c_~var_1_28~0) (fp.geq c_~var_1_14~0 .cse1) (= ((_ extract 15 0) (bvadd (bvneg (bvadd .cse0 (_ bv1000 32))) ((_ zero_extend 16) c_~var_1_5~0))) c_~var_1_10~0) (= c_~var_1_9~0 (let ((.cse2 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse2) .cse2))) (fp.leq c_~var_1_14~0 .cse3) (fp.geq c_~var_1_13~0 .cse1) (bvsge c_~var_1_21~0 (_ bv1073741822 32)) (fp.leq c_~var_1_13~0 .cse3) (not (= c_~var_1_3~0 (_ bv0 8))) (= (_ bv128 32) c_~var_1_16~0) (= c_~var_1_23~0 c_~var_1_22~0) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse4 (fp.lt c_~var_1_14~0 .cse5))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse4) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 c_~var_1_13~0)) c_~var_1_17~0) (not .cse4))))) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 18:06:28,094 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) c_~var_1_22~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)))) (and (not (= (_ bv0 8) c_~var_1_18~0)) (= c_~var_1_1~0 ((_ extract 15 0) .cse0)) (= (fp.sub c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0) c_~var_1_12~0) (= c_~var_1_21~0 c_~var_1_28~0) (fp.geq c_~var_1_14~0 .cse1) (= ((_ extract 15 0) (bvadd (bvneg (bvadd .cse0 (_ bv1000 32))) ((_ zero_extend 16) c_~var_1_5~0))) c_~var_1_10~0) (= c_~var_1_9~0 (let ((.cse2 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse2) .cse2))) (fp.leq c_~var_1_14~0 .cse3) (fp.geq c_~var_1_13~0 .cse1) (bvsge c_~var_1_21~0 (_ bv1073741822 32)) (fp.leq c_~var_1_13~0 .cse3) (not (= c_~var_1_3~0 (_ bv0 8))) (= (_ bv128 32) c_~var_1_16~0) (= c_~var_1_23~0 c_~var_1_22~0) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse4 (fp.lt c_~var_1_14~0 .cse5))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse4) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 c_~var_1_13~0)) c_~var_1_17~0) (not .cse4))))) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 18:06:36,272 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 18:06:47,293 WARN L286 SmtUtils]: Spent 7.27s 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:06:57,975 WARN L286 SmtUtils]: Spent 6.40s 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:07:05,557 WARN L286 SmtUtils]: Spent 7.58s 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:07:12,106 WARN L286 SmtUtils]: Spent 6.55s 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:07:17,524 WARN L286 SmtUtils]: Spent 5.42s 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:07:30,690 WARN L286 SmtUtils]: Spent 6.02s 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:07:45,723 WARN L286 SmtUtils]: Spent 6.39s 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:07:52,811 WARN L286 SmtUtils]: Spent 7.09s 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:08:02,355 WARN L286 SmtUtils]: Spent 6.71s 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:08:09,177 WARN L286 SmtUtils]: Spent 6.82s 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:08:17,307 WARN L286 SmtUtils]: Spent 8.13s 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:08:25,440 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 18:08:35,109 WARN L286 SmtUtils]: Spent 6.58s 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:08:39,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_22~0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse0 ((_ extract 15 0) .cse2))) (and (not (= (_ bv0 8) c_~var_1_18~0)) (= c_~var_1_1~0 .cse0) (= (fp.sub c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0) c_~var_1_12~0) (= c_~var_1_21~0 c_~var_1_28~0) (fp.geq c_~var_1_14~0 .cse1) (= ((_ extract 15 0) (bvadd (bvneg (bvadd .cse2 (_ bv1000 32))) ((_ zero_extend 16) c_~var_1_5~0))) c_~var_1_10~0) (= c_~var_1_9~0 (let ((.cse3 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse3) .cse3))) (fp.leq c_~var_1_14~0 .cse4) (fp.geq c_~var_1_13~0 .cse1) (bvsge c_~var_1_21~0 (_ bv1073741822 32)) (fp.leq c_~var_1_13~0 .cse4) (not (= c_~var_1_3~0 (_ bv0 8))) (= (_ bv128 32) c_~var_1_16~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_24~0 .cse0) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse5 (fp.lt c_~var_1_14~0 .cse6))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse5) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 c_~var_1_13~0)) c_~var_1_17~0) (not .cse5))))) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false
[2024-11-08 18:08:43,176 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) c_~var_1_22~0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse0 ((_ extract 15 0) .cse2))) (and (not (= (_ bv0 8) c_~var_1_18~0)) (= c_~var_1_1~0 .cse0) (= (fp.sub c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0) c_~var_1_12~0) (= c_~var_1_21~0 c_~var_1_28~0) (fp.geq c_~var_1_14~0 .cse1) (= ((_ extract 15 0) (bvadd (bvneg (bvadd .cse2 (_ bv1000 32))) ((_ zero_extend 16) c_~var_1_5~0))) c_~var_1_10~0) (= c_~var_1_9~0 (let ((.cse3 ((_ zero_extend 24) c_~last_1_var_1_22~0))) (bvadd (bvneg .cse3) .cse3))) (fp.leq c_~var_1_14~0 .cse4) (fp.geq c_~var_1_13~0 .cse1) (bvsge c_~var_1_21~0 (_ bv1073741822 32)) (fp.leq c_~var_1_13~0 .cse4) (not (= c_~var_1_3~0 (_ bv0 8))) (= (_ bv128 32) c_~var_1_16~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_24~0 .cse0) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1277.0 5.0))))) (let ((.cse5 (fp.lt c_~var_1_14~0 .cse6))) (or (and (= c_~var_1_17~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode c_~var_1_14~0 c_~var_1_13~0))) .cse5) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 c_~var_1_13~0)) c_~var_1_17~0) (not .cse5))))) (= ((_ zero_extend 8) c_~var_1_22~0) c_~var_1_7~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true
[2024-11-08 18:08:49,641 WARN L286 SmtUtils]: Spent 6.44s 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:08:55,239 WARN L286 SmtUtils]: Spent 5.60s 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:09:02,849 WARN L286 SmtUtils]: Spent 7.61s 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:09:09,218 WARN L286 SmtUtils]: Spent 6.37s 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)