./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:13:26,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:13:26,179 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:13:26,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:13:26,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:13:26,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:13:26,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:13:26,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:13:26,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:13:26,216 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:13:26,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:13:26,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:13:26,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:13:26,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:13:26,219 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:13:26,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:13:26,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:13:26,221 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:13:26,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:13:26,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:13:26,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:13:26,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:13:26,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:13:26,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:13:26,225 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:13:26,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:13:26,226 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:13:26,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:13:26,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:13:26,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:13:26,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:13:26,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:13:26,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:13:26,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:13:26,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:13:26,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:13:26,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:13:26,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:13:26,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:13:26,230 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:13:26,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:13:26,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:13:26,231 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2023-11-29 02:13:26,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:13:26,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:13:26,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:13:26,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:13:26,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:13:26,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2023-11-29 02:13:29,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:13:29,576 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:13:29,577 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c [2023-11-29 02:13:29,584 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/9785bcbe0/424f259e41f04684b0ce74f656ecd5c3/FLAGbb2de21a5 [2023-11-29 02:13:29,597 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/9785bcbe0/424f259e41f04684b0ce74f656ecd5c3 [2023-11-29 02:13:29,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:13:29,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:13:29,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:13:29,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:13:29,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:13:29,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24baf20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29, skipping insertion in model container [2023-11-29 02:13:29,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,627 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:13:29,767 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2023-11-29 02:13:29,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:13:29,798 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:13:29,812 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2023-11-29 02:13:29,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:13:29,832 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:13:29,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29 WrapperNode [2023-11-29 02:13:29,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:13:29,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:13:29,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:13:29,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:13:29,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,864 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2023-11-29 02:13:29,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:13:29,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:13:29,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:13:29,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:13:29,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,888 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-29 02:13:29,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:13:29,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:13:29,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:13:29,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:13:29,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (1/1) ... [2023-11-29 02:13:29,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:13:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:13:29,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:13:29,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:13:29,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:13:29,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:13:29,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:13:29,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:13:29,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 02:13:29,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 02:13:30,047 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:13:30,050 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:13:30,174 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:13:30,202 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:13:30,202 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:13:30,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:13:30 BoogieIcfgContainer [2023-11-29 02:13:30,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:13:30,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:13:30,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:13:30,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:13:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:13:29" (1/3) ... [2023-11-29 02:13:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d820825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:13:30, skipping insertion in model container [2023-11-29 02:13:30,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:29" (2/3) ... [2023-11-29 02:13:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d820825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:13:30, skipping insertion in model container [2023-11-29 02:13:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:13:30" (3/3) ... [2023-11-29 02:13:30,212 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2023-11-29 02:13:30,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:13:30,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:13:30,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:13:30,286 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;@7904350f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:13:30,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:13:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:13:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:30,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:30,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:30,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:30,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2048601052, now seen corresponding path program 1 times [2023-11-29 02:13:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:13:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610371790] [2023-11-29 02:13:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:13:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:13:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610371790] [2023-11-29 02:13:30,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610371790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:30,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:13:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838186028] [2023-11-29 02:13:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:30,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:13:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:13:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:13:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:13:30,488 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:30,515 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2023-11-29 02:13:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:13:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:13:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:30,524 INFO L225 Difference]: With dead ends: 27 [2023-11-29 02:13:30,525 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 02:13:30,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:13:30,532 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:30,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:13:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 02:13:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 02:13:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:13:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 02:13:30,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2023-11-29 02:13:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:30,570 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 02:13:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 02:13:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:30,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:30,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:30,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:13:30,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:30,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2041212884, now seen corresponding path program 1 times [2023-11-29 02:13:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:13:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422255811] [2023-11-29 02:13:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:13:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:13:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422255811] [2023-11-29 02:13:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422255811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:13:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755178505] [2023-11-29 02:13:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:30,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:13:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:13:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:13:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:13:30,651 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:30,673 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-11-29 02:13:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:13:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:13:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:30,675 INFO L225 Difference]: With dead ends: 23 [2023-11-29 02:13:30,675 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 02:13:30,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-29 02:13:30,678 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:30,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:13:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 02:13:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2023-11-29 02:13:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:13:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-29 02:13:30,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2023-11-29 02:13:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:30,687 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-29 02:13:30,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-29 02:13:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:30,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:30,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:30,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:13:30,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:30,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2042940762, now seen corresponding path program 1 times [2023-11-29 02:13:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:13:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066617811] [2023-11-29 02:13:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:13:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:13:30,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:13:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:13:30,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:13:30,775 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:13:30,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:13:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:13:30,783 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 02:13:30,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:13:30,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:13:30 BoogieIcfgContainer [2023-11-29 02:13:30,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:13:30,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:13:30,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:13:30,804 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:13:30,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:13:30" (3/4) ... [2023-11-29 02:13:30,807 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:13:30,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:13:30,809 INFO L158 Benchmark]: Toolchain (without parser) took 1208.85ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 156.5MB in the end (delta: -52.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:13:30,809 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:13:30,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.99ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 93.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:13:30,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:13:30,811 INFO L158 Benchmark]: Boogie Preprocessor took 35.86ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:13:30,812 INFO L158 Benchmark]: RCFGBuilder took 300.86ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 80.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:13:30,813 INFO L158 Benchmark]: TraceAbstraction took 597.48ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 79.4MB in the beginning and 156.5MB in the end (delta: -77.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:13:30,813 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 186.6MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:13:30,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.99ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 93.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.86ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.86ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 80.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 597.48ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 79.4MB in the beginning and 156.5MB in the end (delta: -77.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 186.6MB. Free memory is still 156.5MB. 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: 10]: 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 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x1=12, x=12, y1=16, y=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-29 02:13:30,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:13:32,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:13:32,954 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 02:13:32,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:13:32,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:13:32,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:13:32,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:13:32,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:13:32,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:13:32,990 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:13:32,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:13:32,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:13:32,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:13:32,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:13:32,993 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:13:32,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:13:32,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:13:32,995 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:13:32,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:13:32,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:13:32,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:13:32,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:13:32,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:13:32,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:13:32,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:13:32,999 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:13:33,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:13:33,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:13:33,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:13:33,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:13:33,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:13:33,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:13:33,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:13:33,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:13:33,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:13:33,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:13:33,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:13:33,003 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:13:33,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:13:33,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:13:33,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:13:33,005 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:13:33,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:13:33,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:13:33,005 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:13:33,005 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2023-11-29 02:13:33,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:13:33,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:13:33,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:13:33,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:13:33,354 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:13:33,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2023-11-29 02:13:36,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:13:36,486 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:13:36,486 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c [2023-11-29 02:13:36,493 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/dd69f3f8c/062776b24b5241518d91587b0e4414b9/FLAG1fbda053c [2023-11-29 02:13:36,509 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/data/dd69f3f8c/062776b24b5241518d91587b0e4414b9 [2023-11-29 02:13:36,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:13:36,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:13:36,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:13:36,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:13:36,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:13:36,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b42729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36, skipping insertion in model container [2023-11-29 02:13:36,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:13:36,691 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2023-11-29 02:13:36,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:13:36,722 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:13:36,734 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_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2023-11-29 02:13:36,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:13:36,756 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:13:36,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36 WrapperNode [2023-11-29 02:13:36,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:13:36,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:13:36,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:13:36,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:13:36,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,798 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-11-29 02:13:36,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:13:36,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:13:36,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:13:36,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:13:36,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,824 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-29 02:13:36,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:13:36,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:13:36,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:13:36,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:13:36,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (1/1) ... [2023-11-29 02:13:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:13:36,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:13:36,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:13:36,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:13:36,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:13:36,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:13:36,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:13:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:13:36,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 02:13:36,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 02:13:37,024 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:13:37,027 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:13:41,225 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:13:41,249 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:13:41,250 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:13:41,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:13:41 BoogieIcfgContainer [2023-11-29 02:13:41,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:13:41,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:13:41,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:13:41,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:13:41,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:13:36" (1/3) ... [2023-11-29 02:13:41,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160eeac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:13:41, skipping insertion in model container [2023-11-29 02:13:41,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:13:36" (2/3) ... [2023-11-29 02:13:41,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160eeac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:13:41, skipping insertion in model container [2023-11-29 02:13:41,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:13:41" (3/3) ... [2023-11-29 02:13:41,261 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2023-11-29 02:13:41,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:13:41,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:13:41,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:13:41,346 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;@13f3a8ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:13:41,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:13:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:13:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:41,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:41,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:41,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:41,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2048601052, now seen corresponding path program 1 times [2023-11-29 02:13:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626751822] [2023-11-29 02:13:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:41,383 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-29 02:13:41,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:41,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:41,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:41,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:13:41,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:41,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:41,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626751822] [2023-11-29 02:13:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626751822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:13:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579909724] [2023-11-29 02:13:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:13:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:13:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:13:41,563 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:41,599 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2023-11-29 02:13:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:13:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:13:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:41,610 INFO L225 Difference]: With dead ends: 27 [2023-11-29 02:13:41,611 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 02:13:41,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:13:41,619 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:41,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:13:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 02:13:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 02:13:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:13:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 02:13:41,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2023-11-29 02:13:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:41,674 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 02:13:41,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 02:13:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:41,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:41,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:41,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:13:41,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:41,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:41,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2041212884, now seen corresponding path program 1 times [2023-11-29 02:13:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940885766] [2023-11-29 02:13:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:41,882 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-29 02:13:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:41,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:41,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (3)] Waiting until timeout for monitored process [2023-11-29 02:13:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:41,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:13:41,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:41,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:41,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940885766] [2023-11-29 02:13:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940885766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:13:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220541228] [2023-11-29 02:13:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:13:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:13:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:13:41,984 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:46,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:50,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:50,272 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-11-29 02:13:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:13:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:13:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:50,309 INFO L225 Difference]: With dead ends: 23 [2023-11-29 02:13:50,309 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 02:13:50,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-29 02:13:50,311 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:50,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2023-11-29 02:13:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 02:13:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2023-11-29 02:13:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:13:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-29 02:13:50,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2023-11-29 02:13:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:50,319 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-29 02:13:50,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-29 02:13:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:13:50,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:50,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:13:50,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (3)] Ended with exit code 0 [2023-11-29 02:13:50,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:50,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:50,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2042940762, now seen corresponding path program 1 times [2023-11-29 02:13:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415427378] [2023-11-29 02:13:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:50,523 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-29 02:13:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:50,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:50,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:50,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 02:13:50,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:51,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:51,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415427378] [2023-11-29 02:13:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415427378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:13:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332847309] [2023-11-29 02:13:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:51,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:13:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:13:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:13:51,972 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:53,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:54,600 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-29 02:13:58,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:59,062 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-29 02:13:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:13:59,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:13:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:59,064 INFO L225 Difference]: With dead ends: 24 [2023-11-29 02:13:59,064 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 02:13:59,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:13:59,066 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:59,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-29 02:13:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 02:13:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-11-29 02:13:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:13:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-11-29 02:13:59,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2023-11-29 02:13:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:59,072 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-11-29 02:13:59,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-11-29 02:13:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:13:59,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:59,073 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:59,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:59,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:59,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:13:59,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2127350750, now seen corresponding path program 1 times [2023-11-29 02:13:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352442607] [2023-11-29 02:13:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:59,275 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-29 02:13:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:59,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:13:59,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (5)] Waiting until timeout for monitored process [2023-11-29 02:13:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:59,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 02:13:59,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:14:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:14:00,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:14:06,608 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:11,639 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:15,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2023-11-29 02:14:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:14:18,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:14:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352442607] [2023-11-29 02:14:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352442607] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 02:14:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:14:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-11-29 02:14:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725196774] [2023-11-29 02:14:18,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:14:18,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:14:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:14:18,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:14:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2023-11-29 02:14:18,330 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:15:12,564 WARN L293 SmtUtils]: Spent 25.82s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:15:16,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:20,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:24,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:28,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:32,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:36,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:40,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:45,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:15:45,192 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-11-29 02:15:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:15:45,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 02:15:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:15:45,229 INFO L225 Difference]: With dead ends: 28 [2023-11-29 02:15:45,229 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 02:15:45,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.7s TimeCoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2023-11-29 02:15:45,231 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:15:45,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 8 Unknown, 17 Unchecked, 32.6s Time] [2023-11-29 02:15:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 02:15:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2023-11-29 02:15:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 02:15:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-29 02:15:45,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2023-11-29 02:15:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:15:45,240 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-29 02:15:45,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:15:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-29 02:15:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 02:15:45,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:15:45,241 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:15:45,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (5)] Ended with exit code 0 [2023-11-29 02:15:45,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:15:45,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:15:45,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:15:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash -772370796, now seen corresponding path program 1 times [2023-11-29 02:15:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:15:45,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123700458] [2023-11-29 02:15:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:15:45,443 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-29 02:15:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:15:45,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:15:45,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:15:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:15:45,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:15:45,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:15:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:15:45,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:15:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:15:45,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:15:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123700458] [2023-11-29 02:15:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123700458] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:15:45,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:15:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-29 02:15:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666765468] [2023-11-29 02:15:45,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:15:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:15:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:15:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:15:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:15:45,760 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:15:49,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:53,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:15:57,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:00,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:04,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:09,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:09,160 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-11-29 02:16:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:16:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2023-11-29 02:16:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:09,200 INFO L225 Difference]: With dead ends: 40 [2023-11-29 02:16:09,200 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 02:16:09,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:09,201 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:09,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 23.4s Time] [2023-11-29 02:16:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 02:16:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 02:16:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:16:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-29 02:16:09,209 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2023-11-29 02:16:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:09,210 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-29 02:16:09,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:16:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-29 02:16:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 02:16:09,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:09,211 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:09,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:16:09,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:16:09,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:09,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -770642918, now seen corresponding path program 1 times [2023-11-29 02:16:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:16:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89373621] [2023-11-29 02:16:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:09,412 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-29 02:16:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:16:09,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:16:09,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (7)] Waiting until timeout for monitored process [2023-11-29 02:16:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:09,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 02:16:09,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 02:16:19,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:16:27,008 WARN L293 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:35,106 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:41,990 WARN L293 SmtUtils]: Spent 15.99s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:17:52,320 WARN L293 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:00,418 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:11,923 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:19,317 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:27,699 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:35,981 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:40,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2023-11-29 02:18:44,118 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2023-11-29 02:18:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-29 02:18:44,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:18:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89373621] [2023-11-29 02:18:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89373621] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:18:44,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:18:44,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 02:18:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391197785] [2023-11-29 02:18:44,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:18:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:18:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:18:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=9, NotChecked=20, Total=156 [2023-11-29 02:18:44,121 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:18:48,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 02:18:52,250 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 02:18:55,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:03,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:11,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:14,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:18,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:20,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:22,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:00,188 WARN L293 SmtUtils]: Spent 18.53s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:20:03,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:05,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:09,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:11,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:14,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:18,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:21,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:25,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:27,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:37,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:41,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:44,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:48,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:52,554 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 [] [2023-11-29 02:20:56,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:04,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:08,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:12,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:16,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:20,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:24,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:28,976 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 [] [2023-11-29 02:21:32,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:36,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:40,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:44,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:48,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:52,709 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 [] [2023-11-29 02:21:56,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:21:56,843 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-11-29 02:21:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:21:56,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2023-11-29 02:21:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:21:56,874 INFO L225 Difference]: With dead ends: 39 [2023-11-29 02:21:56,874 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 02:21:56,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 146.3s TimeCoverageRelationStatistics Valid=67, Invalid=198, Unknown=15, NotChecked=62, Total=342 [2023-11-29 02:21:56,876 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 130.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:21:56,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 22 Unknown, 43 Unchecked, 130.9s Time] [2023-11-29 02:21:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 02:21:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 02:21:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:21:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-29 02:21:56,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2023-11-29 02:21:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:21:56,885 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-29 02:21:56,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 02:21:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-29 02:21:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 02:21:56,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:21:56,886 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 02:21:56,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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 (7)] Ended with exit code 0 [2023-11-29 02:21:57,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:21:57,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:21:57,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash -284826338, now seen corresponding path program 2 times [2023-11-29 02:21:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:21:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729208038] [2023-11-29 02:21:57,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:21:57,088 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-29 02:21:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:21:57,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:21:57,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:21:57,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:21:57,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:21:57,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 02:21:57,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 02:22:07,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:22:12,829 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:20,609 WARN L293 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:24,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2023-11-29 02:22:38,387 WARN L293 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:44,931 WARN L293 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:53,028 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:58,335 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:06,087 WARN L293 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:14,389 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:22,762 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:26,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2023-11-29 02:23:30,898 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2023-11-29 02:23:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2023-11-29 02:23:30,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:23:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729208038] [2023-11-29 02:23:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729208038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:23:30,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:23:30,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 02:23:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017406432] [2023-11-29 02:23:30,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:23:30,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:23:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:23:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:23:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=5, NotChecked=38, Total=156 [2023-11-29 02:23:30,901 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 02:23:34,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 02:23:39,064 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 02:23:43,096 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 02:23:47,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:23:51,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:23:53,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:23:57,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:24:00,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:24:04,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:24:08,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:24:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:24:09,166 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-29 02:24:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:24:09,171 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2023-11-29 02:24:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:24:09,172 INFO L225 Difference]: With dead ends: 43 [2023-11-29 02:24:09,172 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 02:24:09,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=53, Invalid=137, Unknown=8, NotChecked=108, Total=306 [2023-11-29 02:24:09,173 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:24:09,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 52 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 5 Unknown, 114 Unchecked, 25.9s Time] [2023-11-29 02:24:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 02:24:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 02:24:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:24:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-29 02:24:09,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2023-11-29 02:24:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:24:09,184 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-29 02:24:09,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 02:24:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-29 02:24:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 02:24:09,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:24:09,186 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-11-29 02:24:09,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:24:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:24:09,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:24:09,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:24:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1042488926, now seen corresponding path program 3 times [2023-11-29 02:24:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:24:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885690497] [2023-11-29 02:24:09,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:24:09,387 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-29 02:24:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:24:09,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:24:09,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9b015ff-dfe2-4c47-9f99-14fadab25dc9/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-29 02:24:10,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 02:24:10,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:24:10,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 02:24:10,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:24:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 02:24:45,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:24:54,608 WARN L293 SmtUtils]: Spent 8.21s 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-29 02:25:02,803 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:25:11,002 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:25:19,215 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:25:23,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24)))))) is different from false [2023-11-29 02:25:27,322 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.leq .cse4 .cse1)) (not (fp.geq .cse4 (_ +zero 8 24)))))) is different from true [2023-11-29 02:25:35,515 WARN L293 SmtUtils]: Spent 8.19s 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-29 02:25:43,696 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:25:51,875 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:00,066 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:08,279 WARN L293 SmtUtils]: Spent 8.21s 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-29 02:26:16,484 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:24,681 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:32,892 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:41,067 WARN L293 SmtUtils]: Spent 8.17s 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-29 02:26:49,251 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:26:57,434 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:05,627 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:14,062 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:22,475 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:30,839 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:39,203 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:27:43,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) .cse4) (fp.div c_currentRoundingMode .cse6 .cse4)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) .cse4)))) (and (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 8 24)))) (not (fp.geq .cse0 (_ +zero 8 24))))))) is different from false [2023-11-29 02:27:47,379 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse6 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) .cse4) (fp.div c_currentRoundingMode .cse6 .cse4)))) (or (not (fp.leq .cse0 .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse6) .cse4)))) (and (fp.leq .cse2 .cse1) (fp.geq .cse2 (_ +zero 8 24)))) (not (fp.geq .cse0 (_ +zero 8 24))))))) is different from true [2023-11-29 02:27:55,707 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:04,031 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:12,355 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:20,674 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:28,992 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:37,321 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:28:45,657 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)