./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya --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 0371006a69b6a88167f90c9dfd406d83877627cd3b41de6f41a77ad1632e19a2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:28:35,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:28:35,342 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:28:35,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:28:35,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:28:35,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:28:35,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:28:35,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:28:35,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:28:35,372 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:28:35,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:28:35,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:28:35,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:28:35,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:28:35,375 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:28:35,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:28:35,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:28:35,377 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:28:35,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:28:35,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:28:35,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:28:35,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:28:35,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:28:35,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:28:35,380 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:28:35,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:28:35,381 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:28:35,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:28:35,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:28:35,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:28:35,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:28:35,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:35,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:28:35,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:28:35,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:28:35,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:28:35,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:28:35,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:28:35,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:28:35,385 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:28:35,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:28:35,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:28:35,385 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0371006a69b6a88167f90c9dfd406d83877627cd3b41de6f41a77ad1632e19a2 [2023-11-28 20:28:35,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:28:35,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:28:35,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:28:35,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:28:35,617 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:28:35,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:38,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:28:38,559 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:28:38,559 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:38,571 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/fc177b376/a8e14731374c4d3b8f8721d1efc7d80b/FLAGe0516c4e7 [2023-11-28 20:28:38,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/fc177b376/a8e14731374c4d3b8f8721d1efc7d80b [2023-11-28 20:28:38,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:28:38,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:28:38,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:38,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:28:38,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:28:38,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60eb7068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38, skipping insertion in model container [2023-11-28 20:28:38,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,628 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:28:38,773 WARN L240 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i[915,928] [2023-11-28 20:28:38,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:38,832 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:28:38,845 WARN L240 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i[915,928] [2023-11-28 20:28:38,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:38,887 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:28:38,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38 WrapperNode [2023-11-28 20:28:38,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:38,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:38,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:28:38,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:28:38,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,935 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-28 20:28:38,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:38,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:28:38,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:28:38,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:28:38,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,966 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]. [2023-11-28 20:28:38,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:28:38,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:28:38,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:28:38,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:28:38,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (1/1) ... [2023-11-28 20:28:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:39,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:28:39,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:28:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:28:39,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:28:39,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:28:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:28:39,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:28:39,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:28:39,126 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:28:39,128 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:28:39,393 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:28:39,438 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:28:39,439 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:28:39,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:39 BoogieIcfgContainer [2023-11-28 20:28:39,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:28:39,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:28:39,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:28:39,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:28:39,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:28:38" (1/3) ... [2023-11-28 20:28:39,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239192c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:39, skipping insertion in model container [2023-11-28 20:28:39,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:38" (2/3) ... [2023-11-28 20:28:39,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239192c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:39, skipping insertion in model container [2023-11-28 20:28:39,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:39" (3/3) ... [2023-11-28 20:28:39,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:39,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:28:39,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:28:39,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:28:39,516 INFO L357 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, mHoare=true, 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;@d129d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:28:39,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:28:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-28 20:28:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-28 20:28:39,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:39,547 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:39,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:39,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 123589163, now seen corresponding path program 1 times [2023-11-28 20:28:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974352161] [2023-11-28 20:28:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:39,739 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-28 20:28:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512471283] [2023-11-28 20:28:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:39,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:28:39,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:28:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:28:39,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-11-28 20:28:40,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:28:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-28 20:28:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974352161] [2023-11-28 20:28:40,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-28 20:28:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512471283] [2023-11-28 20:28:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512471283] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:28:40,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:28:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-28 20:28:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346938724] [2023-11-28 20:28:40,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:28:40,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:28:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:28:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:28:40,554 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2023-11-28 20:28:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:40,928 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2023-11-28 20:28:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:28:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 166 [2023-11-28 20:28:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:40,939 INFO L225 Difference]: With dead ends: 137 [2023-11-28 20:28:40,939 INFO L226 Difference]: Without dead ends: 70 [2023-11-28 20:28:40,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:28:40,945 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 197 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:40,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 124 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:28:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-28 20:28:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-11-28 20:28:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-28 20:28:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2023-11-28 20:28:40,996 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 166 [2023-11-28 20:28:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:40,998 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2023-11-28 20:28:40,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2023-11-28 20:28:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2023-11-28 20:28:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-28 20:28:41,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:41,002 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:41,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:28:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:41,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:41,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2130676059, now seen corresponding path program 1 times [2023-11-28 20:28:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822592930] [2023-11-28 20:28:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:41,272 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-28 20:28:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915129351] [2023-11-28 20:28:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:41,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:28:41,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:28:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:41,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:28:41,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-28 20:28:41,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:28:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822592930] [2023-11-28 20:28:41,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-28 20:28:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915129351] [2023-11-28 20:28:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915129351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:28:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181456919] [2023-11-28 20:28:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:41,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:41,639 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:41,680 INFO L93 Difference]: Finished difference Result 202 states and 307 transitions. [2023-11-28 20:28:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 167 [2023-11-28 20:28:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:41,685 INFO L225 Difference]: With dead ends: 202 [2023-11-28 20:28:41,685 INFO L226 Difference]: Without dead ends: 135 [2023-11-28 20:28:41,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:41,688 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:41,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:28:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-28 20:28:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-11-28 20:28:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-28 20:28:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2023-11-28 20:28:41,726 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 167 [2023-11-28 20:28:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:41,727 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2023-11-28 20:28:41,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2023-11-28 20:28:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-28 20:28:41,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:41,731 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:41,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:28:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:41,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:41,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2132523101, now seen corresponding path program 1 times [2023-11-28 20:28:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694915416] [2023-11-28 20:28:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:41,988 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-28 20:28:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292290397] [2023-11-28 20:28:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:41,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:41,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:28:41,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:28:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:28:42,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:28:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:28:42,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:28:42,387 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:28:42,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:28:42,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:28:42,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:28:42,593 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-28 20:28:42,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:28:42,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:28:42 BoogieIcfgContainer [2023-11-28 20:28:42,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:28:42,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:28:42,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:28:42,700 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:28:42,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:39" (3/4) ... [2023-11-28 20:28:42,703 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:28:42,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:28:42,704 INFO L158 Benchmark]: Toolchain (without parser) took 4117.68ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 50.7MB in the end (delta: 57.5MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,704 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:28:42,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.68ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 94.7MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 92.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,706 INFO L158 Benchmark]: Boogie Preprocessor took 49.66ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,706 INFO L158 Benchmark]: RCFGBuilder took 452.61ms. Allocated memory is still 155.2MB. Free memory was 88.8MB in the beginning and 67.4MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,707 INFO L158 Benchmark]: TraceAbstraction took 3256.90ms. Allocated memory is still 155.2MB. Free memory was 66.7MB in the beginning and 50.7MB in the end (delta: 16.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-11-28 20:28:42,707 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 155.2MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:28:42,710 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.16ms. Allocated memory is still 111.1MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.68ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 94.7MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 92.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.66ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.61ms. Allocated memory is still 155.2MB. Free memory was 88.8MB in the beginning and 67.4MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3256.90ms. Allocated memory is still 155.2MB. Free memory was 66.7MB in the beginning and 50.7MB in the end (delta: 16.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 155.2MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L139] isInitial = 1 [L140] FCALL initially() [L141] int k_loop; [L142] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L142] COND TRUE k_loop < 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_7=0, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L95] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET updateVariables() [L145] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_23=158/5, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L49] COND TRUE var_1_10 <= var_1_17 [L50] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_27=256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=100, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=0, var_1_20=32766, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=1, var_1_20=32766, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L73] COND TRUE \read(var_1_1) [L74] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=64, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=1, var_1_20=32766, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] RET step() [L146] CALL, EXPR property() [L135-L136] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=64, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=1, var_1_20=32766, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=64, var_1_12=63, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-128, var_1_1=1, var_1_20=32766, var_1_22=32766, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 156 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 4 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4512/4536 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 [2023-11-28 20:28:42,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya --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 0371006a69b6a88167f90c9dfd406d83877627cd3b41de6f41a77ad1632e19a2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:28:44,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:28:44,766 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:28:44,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:28:44,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:28:44,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:28:44,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:28:44,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:28:44,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:28:44,804 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:28:44,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:28:44,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:28:44,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:28:44,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:28:44,807 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:28:44,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:28:44,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:28:44,808 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:28:44,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:28:44,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:28:44,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:28:44,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:28:44,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:28:44,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:28:44,812 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:28:44,812 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:28:44,813 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:28:44,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:28:44,813 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:28:44,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:28:44,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:28:44,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:28:44,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:28:44,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:44,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:28:44,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:28:44,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:28:44,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:28:44,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:28:44,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:28:44,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:28:44,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:28:44,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:28:44,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:28:44,818 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:28:44,818 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0371006a69b6a88167f90c9dfd406d83877627cd3b41de6f41a77ad1632e19a2 [2023-11-28 20:28:45,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:28:45,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:28:45,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:28:45,116 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:28:45,116 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:28:45,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:47,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:28:48,075 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:28:48,075 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:48,085 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/4ebe1d7a5/5499d539bf144452b8e205cb1b557bf6/FLAGcc6a3475f [2023-11-28 20:28:48,099 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/data/4ebe1d7a5/5499d539bf144452b8e205cb1b557bf6 [2023-11-28 20:28:48,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:28:48,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:28:48,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:48,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:28:48,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:28:48,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c60298c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48, skipping insertion in model container [2023-11-28 20:28:48,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,145 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:28:48,300 WARN L240 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i[915,928] [2023-11-28 20:28:48,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:48,369 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:28:48,382 WARN L240 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_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-29.i[915,928] [2023-11-28 20:28:48,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:48,428 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:28:48,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48 WrapperNode [2023-11-28 20:28:48,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:48,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:48,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:28:48,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:28:48,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,488 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2023-11-28 20:28:48,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:48,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:28:48,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:28:48,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:28:48,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,550 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]. [2023-11-28 20:28:48,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:28:48,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:28:48,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:28:48,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:28:48,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (1/1) ... [2023-11-28 20:28:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:48,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:28:48,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:28:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:28:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:28:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:28:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:28:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:28:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:28:48,720 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:28:48,723 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:28:50,748 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:28:50,798 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:28:50,799 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:28:50,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:50 BoogieIcfgContainer [2023-11-28 20:28:50,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:28:50,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:28:50,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:28:50,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:28:50,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:28:48" (1/3) ... [2023-11-28 20:28:50,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8cdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:50, skipping insertion in model container [2023-11-28 20:28:50,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:48" (2/3) ... [2023-11-28 20:28:50,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b8cdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:50, skipping insertion in model container [2023-11-28 20:28:50,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:50" (3/3) ... [2023-11-28 20:28:50,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-29.i [2023-11-28 20:28:50,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:28:50,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:28:50,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:28:50,883 INFO L357 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, mHoare=true, 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;@2e0ca287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:28:50,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:28:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-28 20:28:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-28 20:28:50,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:50,905 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:50,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:50,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash 123589163, now seen corresponding path program 1 times [2023-11-28 20:28:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:28:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227849180] [2023-11-28 20:28:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:50,926 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 [2023-11-28 20:28:50,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:28:50,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:28:50,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:28:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:51,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:28:51,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-28 20:28:51,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:28:51,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:28:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227849180] [2023-11-28 20:28:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227849180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:28:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928926222] [2023-11-28 20:28:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:28:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:28:51,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:28:51,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2023-11-28 20:28:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:51,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:28:51,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-28 20:28:52,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:28:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [928926222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:52,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 20:28:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-28 20:28:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139252601] [2023-11-28 20:28:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:52,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:28:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:52,550 INFO L87 Difference]: Start difference. First operand has 66 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:53,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:28:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:54,051 INFO L93 Difference]: Finished difference Result 196 states and 372 transitions. [2023-11-28 20:28:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2023-11-28 20:28:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:54,065 INFO L225 Difference]: With dead ends: 196 [2023-11-28 20:28:54,065 INFO L226 Difference]: Without dead ends: 127 [2023-11-28 20:28:54,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:54,073 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 21 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:54,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 20:28:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-28 20:28:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-11-28 20:28:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-28 20:28:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 199 transitions. [2023-11-28 20:28:54,144 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 199 transitions. Word has length 166 [2023-11-28 20:28:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:54,146 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 199 transitions. [2023-11-28 20:28:54,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2023-11-28 20:28:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-28 20:28:54,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:54,149 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:54,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2023-11-28 20:28:54,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-28 20:28:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:28:54,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:54,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 125436205, now seen corresponding path program 1 times [2023-11-28 20:28:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:28:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808254074] [2023-11-28 20:28:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:54,552 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 [2023-11-28 20:28:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:28:54,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:28:54,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:28:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:54,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:28:54,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-28 20:28:54,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:28:55,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:28:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808254074] [2023-11-28 20:28:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808254074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:28:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [741901937] [2023-11-28 20:28:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:28:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:28:55,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:28:55,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-28 20:28:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:55,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:28:55,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-28 20:28:55,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:28:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [741901937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:55,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 20:28:55,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-28 20:28:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002838856] [2023-11-28 20:28:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:55,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:28:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:55,853 INFO L87 Difference]: Start difference. First operand 125 states and 199 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:57,856 INFO L93 Difference]: Finished difference Result 371 states and 591 transitions. [2023-11-28 20:28:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:57,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 166 [2023-11-28 20:28:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:57,861 INFO L225 Difference]: With dead ends: 371 [2023-11-28 20:28:57,862 INFO L226 Difference]: Without dead ends: 247 [2023-11-28 20:28:57,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:57,865 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:57,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:28:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-28 20:28:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2023-11-28 20:28:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 128 states have (on average 1.28125) internal successors, (164), 128 states have internal predecessors, (164), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-28 20:28:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 388 transitions. [2023-11-28 20:28:57,916 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 388 transitions. Word has length 166 [2023-11-28 20:28:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:57,918 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 388 transitions. [2023-11-28 20:28:57,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-28 20:28:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 388 transitions. [2023-11-28 20:28:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-28 20:28:57,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:57,922 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:57,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-11-28 20:28:58,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 20:28:58,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:28:58,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:58,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 182694507, now seen corresponding path program 1 times [2023-11-28 20:28:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:28:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798253778] [2023-11-28 20:28:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:58,329 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 [2023-11-28 20:28:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:28:58,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:28:58,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:28:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:28:58,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2023-11-28 20:28:58,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:28:58,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:28:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798253778] [2023-11-28 20:28:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798253778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:28:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412498036] [2023-11-28 20:28:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:58,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:28:58,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:28:58,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:28:58,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-28 20:28:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:59,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:28:59,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-28 20:29:00,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-28 20:29:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1412498036] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:00,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-11-28 20:29:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532051484] [2023-11-28 20:29:00,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:29:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:29:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:29:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:29:00,732 INFO L87 Difference]: Start difference. First operand 245 states and 388 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-11-28 20:29:09,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:29:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:14,187 INFO L93 Difference]: Finished difference Result 679 states and 1030 transitions. [2023-11-28 20:29:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-28 20:29:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 166 [2023-11-28 20:29:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:14,193 INFO L225 Difference]: With dead ends: 679 [2023-11-28 20:29:14,193 INFO L226 Difference]: Without dead ends: 435 [2023-11-28 20:29:14,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-11-28 20:29:14,197 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 378 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:14,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 326 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-11-28 20:29:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-11-28 20:29:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 281. [2023-11-28 20:29:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 156 states have (on average 1.2179487179487178) internal successors, (190), 156 states have internal predecessors, (190), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-28 20:29:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 414 transitions. [2023-11-28 20:29:14,265 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 414 transitions. Word has length 166 [2023-11-28 20:29:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:14,266 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 414 transitions. [2023-11-28 20:29:14,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2023-11-28 20:29:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 414 transitions. [2023-11-28 20:29:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-28 20:29:14,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:29:14,269 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:14,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-11-28 20:29:14,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:29:14,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:29:14,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:29:14,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2105185893, now seen corresponding path program 1 times [2023-11-28 20:29:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:29:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674670459] [2023-11-28 20:29:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:14,672 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 [2023-11-28 20:29:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:29:14,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:29:14,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 20:29:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:14,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 20:29:14,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:29,432 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2023-11-28 20:29:33,438 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-11-28 20:29:42,352 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2023-11-28 20:29:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:29:48,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:29:48,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:29:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674670459] [2023-11-28 20:29:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674670459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:48,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-28 20:29:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021717368] [2023-11-28 20:29:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:29:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:29:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:29:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=88, Unknown=3, NotChecked=42, Total=182 [2023-11-28 20:29:48,943 INFO L87 Difference]: Start difference. First operand 281 states and 414 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-28 20:30:59,770 WARN L293 SmtUtils]: Spent 45.23s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:31:04,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6)))))))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-28 20:31:08,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:31:13,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:31:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:31:13,869 INFO L93 Difference]: Finished difference Result 883 states and 1276 transitions. [2023-11-28 20:31:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:31:13,875 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 167 [2023-11-28 20:31:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:31:13,881 INFO L225 Difference]: With dead ends: 883 [2023-11-28 20:31:13,882 INFO L226 Difference]: Without dead ends: 603 [2023-11-28 20:31:13,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 86.4s TimeCoverageRelationStatistics Valid=119, Invalid=226, Unknown=9, NotChecked=108, Total=462 [2023-11-28 20:31:13,885 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 142 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:31:13,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 314 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 328 Invalid, 1 Unknown, 435 Unchecked, 11.5s Time] [2023-11-28 20:31:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2023-11-28 20:31:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 591. [2023-11-28 20:31:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 334 states have internal predecessors, (402), 224 states have call successors, (224), 32 states have call predecessors, (224), 32 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2023-11-28 20:31:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 850 transitions. [2023-11-28 20:31:14,013 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 850 transitions. Word has length 167 [2023-11-28 20:31:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:31:14,013 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 850 transitions. [2023-11-28 20:31:14,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-28 20:31:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 850 transitions. [2023-11-28 20:31:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-28 20:31:14,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:31:14,017 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:31:14,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-28 20:31:14,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:31:14,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:31:14,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:31:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1380434777, now seen corresponding path program 1 times [2023-11-28 20:31:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:31:14,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862049066] [2023-11-28 20:31:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:31:14,228 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 [2023-11-28 20:31:14,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:31:14,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:31:14,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:31:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:31:14,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 20:31:14,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:31:32,203 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-11-28 20:31:42,961 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2023-11-28 20:31:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-11-28 20:31:50,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:31:50,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:31:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862049066] [2023-11-28 20:31:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862049066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:31:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:31:50,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-28 20:31:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494550045] [2023-11-28 20:31:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:31:50,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:31:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:31:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:31:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=89, Unknown=2, NotChecked=42, Total=182 [2023-11-28 20:31:50,711 INFO L87 Difference]: Start difference. First operand 591 states and 850 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-28 20:32:59,088 WARN L293 SmtUtils]: Spent 43.33s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:33:51,031 WARN L293 SmtUtils]: Spent 24.60s on a formula simplification. DAG size of input: 102 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:33:55,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:33:59,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:34:03,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:34:07,267 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] [2023-11-28 20:34:08,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:34:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:34:10,619 INFO L93 Difference]: Finished difference Result 1075 states and 1528 transitions. [2023-11-28 20:34:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:34:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 167 [2023-11-28 20:34:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:34:10,624 INFO L225 Difference]: With dead ends: 1075 [2023-11-28 20:34:10,624 INFO L226 Difference]: Without dead ends: 485 [2023-11-28 20:34:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 128.7s TimeCoverageRelationStatistics Valid=123, Invalid=255, Unknown=10, NotChecked=74, Total=462 [2023-11-28 20:34:10,627 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 52 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:34:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 208 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 307 Invalid, 4 Unknown, 226 Unchecked, 21.2s Time] [2023-11-28 20:34:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-11-28 20:34:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2023-11-28 20:34:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 270 states have (on average 1.1962962962962962) internal successors, (323), 270 states have internal predecessors, (323), 168 states have call successors, (168), 30 states have call predecessors, (168), 30 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2023-11-28 20:34:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 659 transitions. [2023-11-28 20:34:10,695 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 659 transitions. Word has length 167 [2023-11-28 20:34:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:34:10,696 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 659 transitions. [2023-11-28 20:34:10,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2023-11-28 20:34:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 659 transitions. [2023-11-28 20:34:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-28 20:34:10,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:34:10,699 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:34:10,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-28 20:34:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:34:10,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:34:10,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 990907681, now seen corresponding path program 1 times [2023-11-28 20:34:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:34:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622981814] [2023-11-28 20:34:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:10,900 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 [2023-11-28 20:34:10,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:34:10,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:34:10,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Waiting until timeout for monitored process [2023-11-28 20:34:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:11,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:34:11,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2023-11-28 20:34:11,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:34:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-28 20:34:12,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:34:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622981814] [2023-11-28 20:34:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622981814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:12,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:34:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-11-28 20:34:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200999676] [2023-11-28 20:34:12,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:34:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:34:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:34:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:34:12,231 INFO L87 Difference]: Start difference. First operand 469 states and 659 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-11-28 20:34:14,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:34:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:34:14,626 INFO L93 Difference]: Finished difference Result 1239 states and 1698 transitions. [2023-11-28 20:34:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:34:14,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 168 [2023-11-28 20:34:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:34:14,631 INFO L225 Difference]: With dead ends: 1239 [2023-11-28 20:34:14,632 INFO L226 Difference]: Without dead ends: 771 [2023-11-28 20:34:14,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:34:14,634 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:34:14,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 209 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 20:34:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-11-28 20:34:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 493. [2023-11-28 20:34:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 288 states have (on average 1.1736111111111112) internal successors, (338), 288 states have internal predecessors, (338), 168 states have call successors, (168), 36 states have call predecessors, (168), 36 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2023-11-28 20:34:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 674 transitions. [2023-11-28 20:34:14,709 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 674 transitions. Word has length 168 [2023-11-28 20:34:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:34:14,710 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 674 transitions. [2023-11-28 20:34:14,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-11-28 20:34:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 674 transitions. [2023-11-28 20:34:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-28 20:34:14,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:34:14,713 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:34:14,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Ended with exit code 0 [2023-11-28 20:34:14,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:34:14,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:34:14,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 992754723, now seen corresponding path program 1 times [2023-11-28 20:34:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:34:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446735443] [2023-11-28 20:34:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:14,915 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 [2023-11-28 20:34:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:34:14,916 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:34:14,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Waiting until timeout for monitored process [2023-11-28 20:34:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:15,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:34:15,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2023-11-28 20:34:16,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:34:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2023-11-28 20:34:16,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:34:16,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446735443] [2023-11-28 20:34:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446735443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:16,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:34:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-28 20:34:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640396982] [2023-11-28 20:34:16,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:16,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:34:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:34:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:34:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:34:16,770 INFO L87 Difference]: Start difference. First operand 493 states and 674 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-11-28 20:34:19,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:34:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:34:20,408 INFO L93 Difference]: Finished difference Result 1069 states and 1419 transitions. [2023-11-28 20:34:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:34:20,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 168 [2023-11-28 20:34:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:34:20,418 INFO L225 Difference]: With dead ends: 1069 [2023-11-28 20:34:20,419 INFO L226 Difference]: Without dead ends: 577 [2023-11-28 20:34:20,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2023-11-28 20:34:20,422 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 123 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:34:20,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 428 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-28 20:34:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2023-11-28 20:34:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 541. [2023-11-28 20:34:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 324 states have (on average 1.126543209876543) internal successors, (365), 324 states have internal predecessors, (365), 168 states have call successors, (168), 48 states have call predecessors, (168), 48 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2023-11-28 20:34:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 701 transitions. [2023-11-28 20:34:20,544 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 701 transitions. Word has length 168 [2023-11-28 20:34:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:34:20,545 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 701 transitions. [2023-11-28 20:34:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-11-28 20:34:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 701 transitions. [2023-11-28 20:34:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-28 20:34:20,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:34:20,547 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:34:20,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Ended with exit code 0 [2023-11-28 20:34:20,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:34:20,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:34:20,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1527205211, now seen corresponding path program 1 times [2023-11-28 20:34:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:34:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764014740] [2023-11-28 20:34:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:20,749 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 [2023-11-28 20:34:20,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:34:20,750 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:34:20,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc1ea0ad-a1cb-4c65-9aa8-289652fa5616/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Waiting until timeout for monitored process [2023-11-28 20:34:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:21,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-28 20:34:21,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:35:10,967 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:35:35,546 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:44,151 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:36:52,143 WARN L293 SmtUtils]: Spent 38.56s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:37:21,846 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:37:35,410 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:38:51,653 WARN L293 SmtUtils]: Spent 45.04s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:39:04,155 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:14,152 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:19,797 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:37,285 WARN L293 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:43,041 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:50,122 WARN L293 SmtUtils]: Spent 7.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:39:59,825 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:41:37,595 WARN L293 SmtUtils]: Spent 59.21s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)