./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:51:38,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:51:38,991 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:51:38,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:51:38,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:51:39,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:51:39,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:51:39,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:51:39,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:51:39,023 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:51:39,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:51:39,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:51:39,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:51:39,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:51:39,026 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:51:39,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:51:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:51:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:51:39,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:51:39,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:51:39,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:51:39,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:51:39,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:51:39,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:51:39,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:51:39,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:51:39,032 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:51:39,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:51:39,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:51:39,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:51:39,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:51:39,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:51:39,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:51:39,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:51:39,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:51:39,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:51:39,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:51:39,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:51:39,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:51:39,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:51:39,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:51:39,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:51:39,037 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2023-11-29 01:51:39,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:51:39,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:51:39,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:51:39,286 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:51:39,286 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:51:39,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:51:42,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:51:42,246 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:51:42,246 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:51:42,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/80b6aa0a0/d89ba360e5d94b01b0f601e25a60dc0b/FLAG8546da867 [2023-11-29 01:51:42,271 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/80b6aa0a0/d89ba360e5d94b01b0f601e25a60dc0b [2023-11-29 01:51:42,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:51:42,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:51:42,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:51:42,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:51:42,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:51:42,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c238dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42, skipping insertion in model container [2023-11-29 01:51:42,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,317 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:51:42,463 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2023-11-29 01:51:42,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:51:42,544 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:51:42,557 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2023-11-29 01:51:42,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:51:42,623 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:51:42,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42 WrapperNode [2023-11-29 01:51:42,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:51:42,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:51:42,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:51:42,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:51:42,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,697 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2023-11-29 01:51:42,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:51:42,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:51:42,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:51:42,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:51:42,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,744 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 01:51:42,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:51:42,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:51:42,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:51:42,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:51:42,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (1/1) ... [2023-11-29 01:51:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:51:42,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:51:42,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:51:42,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:51:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:51:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:51:42,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:51:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:51:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:51:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:51:42,980 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:51:42,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:51:43,375 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:51:43,444 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:51:43,444 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:51:43,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:51:43 BoogieIcfgContainer [2023-11-29 01:51:43,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:51:43,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:51:43,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:51:43,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:51:43,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:51:42" (1/3) ... [2023-11-29 01:51:43,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5551eb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:51:43, skipping insertion in model container [2023-11-29 01:51:43,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:51:42" (2/3) ... [2023-11-29 01:51:43,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5551eb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:51:43, skipping insertion in model container [2023-11-29 01:51:43,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:51:43" (3/3) ... [2023-11-29 01:51:43,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:51:43,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:51:43,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:51:43,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:51:43,537 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;@339a6266, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:51:43,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:51:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 64 states have (on average 1.625) internal successors, (104), 65 states have internal predecessors, (104), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 01:51:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 01:51:43,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:43,562 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:43,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:43,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash -737434046, now seen corresponding path program 1 times [2023-11-29 01:51:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218672117] [2023-11-29 01:51:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218672117] [2023-11-29 01:51:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218672117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:51:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443930576] [2023-11-29 01:51:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:44,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:51:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:51:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:51:44,060 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.625) internal successors, (104), 65 states have internal predecessors, (104), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 01:51:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:44,107 INFO L93 Difference]: Finished difference Result 189 states and 351 transitions. [2023-11-29 01:51:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:51:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2023-11-29 01:51:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:44,118 INFO L225 Difference]: With dead ends: 189 [2023-11-29 01:51:44,118 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 01:51:44,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 01:51:44,126 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:44,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:51:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 01:51:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-29 01:51:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 63 states have internal predecessors, (99), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 01:51:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 157 transitions. [2023-11-29 01:51:44,187 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 157 transitions. Word has length 185 [2023-11-29 01:51:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:44,187 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 157 transitions. [2023-11-29 01:51:44,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 01:51:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 157 transitions. [2023-11-29 01:51:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 01:51:44,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:44,193 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:51:44,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:44,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2076263672, now seen corresponding path program 1 times [2023-11-29 01:51:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302009143] [2023-11-29 01:51:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:44,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302009143] [2023-11-29 01:51:44,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302009143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:44,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695262846] [2023-11-29 01:51:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:44,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:44,564 INFO L87 Difference]: Start difference. First operand 94 states and 157 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:44,642 INFO L93 Difference]: Finished difference Result 277 states and 463 transitions. [2023-11-29 01:51:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2023-11-29 01:51:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:44,646 INFO L225 Difference]: With dead ends: 277 [2023-11-29 01:51:44,646 INFO L226 Difference]: Without dead ends: 184 [2023-11-29 01:51:44,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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 01:51:44,649 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 95 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:44,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 315 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:51:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-29 01:51:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2023-11-29 01:51:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.537190082644628) internal successors, (186), 121 states have internal predecessors, (186), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-29 01:51:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 302 transitions. [2023-11-29 01:51:44,682 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 302 transitions. Word has length 185 [2023-11-29 01:51:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:44,683 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 302 transitions. [2023-11-29 01:51:44,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 302 transitions. [2023-11-29 01:51:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 01:51:44,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:44,687 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:44,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:51:44,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:44,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash -224558918, now seen corresponding path program 1 times [2023-11-29 01:51:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:44,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966927386] [2023-11-29 01:51:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:44,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:44,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966927386] [2023-11-29 01:51:44,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966927386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:44,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:44,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:44,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427358716] [2023-11-29 01:51:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:44,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:44,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:44,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:44,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:44,952 INFO L87 Difference]: Start difference. First operand 182 states and 302 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:45,040 INFO L93 Difference]: Finished difference Result 544 states and 904 transitions. [2023-11-29 01:51:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2023-11-29 01:51:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:45,046 INFO L225 Difference]: With dead ends: 544 [2023-11-29 01:51:45,046 INFO L226 Difference]: Without dead ends: 363 [2023-11-29 01:51:45,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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 01:51:45,049 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 90 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:45,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 280 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:51:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-29 01:51:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2023-11-29 01:51:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 238 states have (on average 1.5210084033613445) internal successors, (362), 238 states have internal predecessors, (362), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2023-11-29 01:51:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 594 transitions. [2023-11-29 01:51:45,103 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 594 transitions. Word has length 185 [2023-11-29 01:51:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:45,104 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 594 transitions. [2023-11-29 01:51:45,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 594 transitions. [2023-11-29 01:51:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 01:51:45,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:45,108 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:45,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:51:45,109 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:45,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 313166876, now seen corresponding path program 1 times [2023-11-29 01:51:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464310940] [2023-11-29 01:51:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464310940] [2023-11-29 01:51:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464310940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:45,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:45,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:51:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501805919] [2023-11-29 01:51:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:45,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:51:45,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:51:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:51:45,382 INFO L87 Difference]: Start difference. First operand 359 states and 594 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:45,478 INFO L93 Difference]: Finished difference Result 719 states and 1188 transitions. [2023-11-29 01:51:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:51:45,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2023-11-29 01:51:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:45,483 INFO L225 Difference]: With dead ends: 719 [2023-11-29 01:51:45,484 INFO L226 Difference]: Without dead ends: 361 [2023-11-29 01:51:45,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:51:45,486 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:45,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 487 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:51:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-29 01:51:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2023-11-29 01:51:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 238 states have (on average 1.5126050420168067) internal successors, (360), 238 states have internal predecessors, (360), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2023-11-29 01:51:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 592 transitions. [2023-11-29 01:51:45,529 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 592 transitions. Word has length 185 [2023-11-29 01:51:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:45,530 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 592 transitions. [2023-11-29 01:51:45,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 592 transitions. [2023-11-29 01:51:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 01:51:45,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:45,533 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:45,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:51:45,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:45,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1236385438, now seen corresponding path program 1 times [2023-11-29 01:51:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134308615] [2023-11-29 01:51:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:45,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134308615] [2023-11-29 01:51:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134308615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:51:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289060333] [2023-11-29 01:51:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:45,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:51:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:51:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:51:45,839 INFO L87 Difference]: Start difference. First operand 359 states and 592 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:46,156 INFO L93 Difference]: Finished difference Result 806 states and 1324 transitions. [2023-11-29 01:51:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:51:46,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2023-11-29 01:51:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:46,161 INFO L225 Difference]: With dead ends: 806 [2023-11-29 01:51:46,161 INFO L226 Difference]: Without dead ends: 448 [2023-11-29 01:51:46,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:51:46,163 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 86 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:46,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 468 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:51:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-29 01:51:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 445. [2023-11-29 01:51:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 294 states have (on average 1.4931972789115646) internal successors, (439), 294 states have internal predecessors, (439), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2023-11-29 01:51:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 729 transitions. [2023-11-29 01:51:46,213 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 729 transitions. Word has length 187 [2023-11-29 01:51:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:46,214 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 729 transitions. [2023-11-29 01:51:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 729 transitions. [2023-11-29 01:51:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-29 01:51:46,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:46,217 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:46,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:51:46,217 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:46,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1422061006, now seen corresponding path program 1 times [2023-11-29 01:51:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35570825] [2023-11-29 01:51:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35570825] [2023-11-29 01:51:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35570825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:46,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056640397] [2023-11-29 01:51:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:46,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:46,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:46,437 INFO L87 Difference]: Start difference. First operand 445 states and 729 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:46,555 INFO L93 Difference]: Finished difference Result 1177 states and 1929 transitions. [2023-11-29 01:51:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2023-11-29 01:51:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:46,563 INFO L225 Difference]: With dead ends: 1177 [2023-11-29 01:51:46,563 INFO L226 Difference]: Without dead ends: 733 [2023-11-29 01:51:46,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 01:51:46,566 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 88 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:46,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 340 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:51:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-11-29 01:51:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 726. [2023-11-29 01:51:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 475 states have (on average 1.4947368421052631) internal successors, (710), 480 states have internal predecessors, (710), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2023-11-29 01:51:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1190 transitions. [2023-11-29 01:51:46,671 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1190 transitions. Word has length 190 [2023-11-29 01:51:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:46,671 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1190 transitions. [2023-11-29 01:51:46,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1190 transitions. [2023-11-29 01:51:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-11-29 01:51:46,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:46,675 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:46,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:51:46,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:46,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash -938502352, now seen corresponding path program 1 times [2023-11-29 01:51:46,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268956041] [2023-11-29 01:51:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:47,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:47,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268956041] [2023-11-29 01:51:47,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268956041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:47,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678649472] [2023-11-29 01:51:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:47,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:47,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:47,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:47,074 INFO L87 Difference]: Start difference. First operand 726 states and 1190 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:47,191 INFO L93 Difference]: Finished difference Result 1451 states and 2379 transitions. [2023-11-29 01:51:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2023-11-29 01:51:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:47,200 INFO L225 Difference]: With dead ends: 1451 [2023-11-29 01:51:47,200 INFO L226 Difference]: Without dead ends: 726 [2023-11-29 01:51:47,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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 01:51:47,203 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:47,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:51:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2023-11-29 01:51:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2023-11-29 01:51:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 475 states have (on average 1.4736842105263157) internal successors, (700), 480 states have internal predecessors, (700), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2023-11-29 01:51:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1180 transitions. [2023-11-29 01:51:47,336 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1180 transitions. Word has length 191 [2023-11-29 01:51:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:47,337 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1180 transitions. [2023-11-29 01:51:47,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1180 transitions. [2023-11-29 01:51:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2023-11-29 01:51:47,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:47,340 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:47,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:51:47,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:47,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -680336914, now seen corresponding path program 1 times [2023-11-29 01:51:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984612731] [2023-11-29 01:51:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984612731] [2023-11-29 01:51:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984612731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:47,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365996541] [2023-11-29 01:51:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:47,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:47,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:47,900 INFO L87 Difference]: Start difference. First operand 726 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:48,081 INFO L93 Difference]: Finished difference Result 1586 states and 2582 transitions. [2023-11-29 01:51:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2023-11-29 01:51:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:48,089 INFO L225 Difference]: With dead ends: 1586 [2023-11-29 01:51:48,089 INFO L226 Difference]: Without dead ends: 861 [2023-11-29 01:51:48,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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 01:51:48,092 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:48,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 280 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:51:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-11-29 01:51:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 823. [2023-11-29 01:51:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 542 states have (on average 1.470479704797048) internal successors, (797), 547 states have internal predecessors, (797), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2023-11-29 01:51:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1335 transitions. [2023-11-29 01:51:48,240 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1335 transitions. Word has length 191 [2023-11-29 01:51:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:48,240 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1335 transitions. [2023-11-29 01:51:48,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1335 transitions. [2023-11-29 01:51:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 01:51:48,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:48,244 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:48,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:51:48,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:48,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1305744641, now seen corresponding path program 1 times [2023-11-29 01:51:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030605177] [2023-11-29 01:51:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:48,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030605177] [2023-11-29 01:51:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030605177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:48,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:48,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:51:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593465420] [2023-11-29 01:51:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:48,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:51:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:48,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:51:48,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:51:48,769 INFO L87 Difference]: Start difference. First operand 823 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:48,957 INFO L93 Difference]: Finished difference Result 1586 states and 2578 transitions. [2023-11-29 01:51:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:51:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2023-11-29 01:51:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:48,966 INFO L225 Difference]: With dead ends: 1586 [2023-11-29 01:51:48,966 INFO L226 Difference]: Without dead ends: 861 [2023-11-29 01:51:48,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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 01:51:48,970 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 69 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:48,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 281 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:51:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-11-29 01:51:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 827. [2023-11-29 01:51:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 546 states have (on average 1.467032967032967) internal successors, (801), 551 states have internal predecessors, (801), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2023-11-29 01:51:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1339 transitions. [2023-11-29 01:51:49,130 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1339 transitions. Word has length 192 [2023-11-29 01:51:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:49,130 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1339 transitions. [2023-11-29 01:51:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1339 transitions. [2023-11-29 01:51:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 01:51:49,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:49,134 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:51:49,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:49,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash -625686271, now seen corresponding path program 1 times [2023-11-29 01:51:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781589154] [2023-11-29 01:51:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:51:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781589154] [2023-11-29 01:51:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781589154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:51:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:51:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:51:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885516203] [2023-11-29 01:51:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:51:49,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:51:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:51:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:51:49,507 INFO L87 Difference]: Start difference. First operand 827 states and 1339 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:50,189 INFO L93 Difference]: Finished difference Result 1582 states and 2566 transitions. [2023-11-29 01:51:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:51:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2023-11-29 01:51:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:50,198 INFO L225 Difference]: With dead ends: 1582 [2023-11-29 01:51:50,198 INFO L226 Difference]: Without dead ends: 841 [2023-11-29 01:51:50,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:51:50,202 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 260 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:50,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 609 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:51:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2023-11-29 01:51:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 835. [2023-11-29 01:51:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 554 states have (on average 1.463898916967509) internal successors, (811), 559 states have internal predecessors, (811), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2023-11-29 01:51:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1349 transitions. [2023-11-29 01:51:50,362 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1349 transitions. Word has length 192 [2023-11-29 01:51:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:50,363 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1349 transitions. [2023-11-29 01:51:50,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:51:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1349 transitions. [2023-11-29 01:51:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 01:51:50,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:50,366 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:50,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:51:50,366 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:50,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2080933123, now seen corresponding path program 1 times [2023-11-29 01:51:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337255178] [2023-11-29 01:51:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-11-29 01:51:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337255178] [2023-11-29 01:51:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337255178] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:51:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028823412] [2023-11-29 01:51:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:51:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:51:50,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:51:50,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:51:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:50,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:51:50,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:51:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2023-11-29 01:51:51,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:51:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-11-29 01:51:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028823412] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:51:51,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:51:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-29 01:51:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538482588] [2023-11-29 01:51:51,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:51:51,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:51:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:51:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:51:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:51:51,363 INFO L87 Difference]: Start difference. First operand 835 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-11-29 01:51:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:51,855 INFO L93 Difference]: Finished difference Result 1680 states and 2664 transitions. [2023-11-29 01:51:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:51:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 192 [2023-11-29 01:51:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:51,862 INFO L225 Difference]: With dead ends: 1680 [2023-11-29 01:51:51,863 INFO L226 Difference]: Without dead ends: 903 [2023-11-29 01:51:51,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:51:51,866 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 261 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:51,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 329 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:51:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2023-11-29 01:51:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 879. [2023-11-29 01:51:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 587 states have (on average 1.4275979557069847) internal successors, (838), 592 states have internal predecessors, (838), 269 states have call successors, (269), 22 states have call predecessors, (269), 22 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2023-11-29 01:51:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1376 transitions. [2023-11-29 01:51:52,067 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1376 transitions. Word has length 192 [2023-11-29 01:51:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:52,068 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1376 transitions. [2023-11-29 01:51:52,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-11-29 01:51:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1376 transitions. [2023-11-29 01:51:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-29 01:51:52,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:52,072 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:52,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:51:52,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:51:52,273 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:51:52,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1835989749, now seen corresponding path program 1 times [2023-11-29 01:51:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:51:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323698808] [2023-11-29 01:51:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:51:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:51:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:51:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:51:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:51:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:51:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:51:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:51:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:51:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:51:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:51:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:51:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:51:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:51:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:51:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:51:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 01:51:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 01:51:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 01:51:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 01:51:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:51:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 01:51:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 01:51:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 01:51:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 01:51:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:51:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:51:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:51:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:51:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:51:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 81 proven. 219 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2023-11-29 01:51:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:51:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323698808] [2023-11-29 01:51:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323698808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:51:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093642553] [2023-11-29 01:51:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:55,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:51:55,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:51:55,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:51:55,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:51:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:55,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:51:55,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:51:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 1073 proven. 237 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-11-29 01:51:58,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:52:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 123 proven. 267 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2023-11-29 01:52:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093642553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:52:02,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:52:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 21] total 49 [2023-11-29 01:52:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781198062] [2023-11-29 01:52:02,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:52:02,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 01:52:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:52:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 01:52:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1829, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 01:52:02,168 INFO L87 Difference]: Start difference. First operand 879 states and 1376 transitions. Second operand has 49 states, 47 states have (on average 3.893617021276596) internal successors, (183), 47 states have internal predecessors, (183), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2023-11-29 01:52:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:52:09,045 INFO L93 Difference]: Finished difference Result 1640 states and 2383 transitions. [2023-11-29 01:52:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-29 01:52:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 3.893617021276596) internal successors, (183), 47 states have internal predecessors, (183), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) Word has length 193 [2023-11-29 01:52:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:52:09,052 INFO L225 Difference]: With dead ends: 1640 [2023-11-29 01:52:09,052 INFO L226 Difference]: Without dead ends: 818 [2023-11-29 01:52:09,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2575, Invalid=6167, Unknown=0, NotChecked=0, Total=8742 [2023-11-29 01:52:09,059 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 633 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:52:09,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 782 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 01:52:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2023-11-29 01:52:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 451. [2023-11-29 01:52:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 332 states have (on average 1.3644578313253013) internal successors, (453), 334 states have internal predecessors, (453), 91 states have call successors, (91), 27 states have call predecessors, (91), 27 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2023-11-29 01:52:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 635 transitions. [2023-11-29 01:52:09,177 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 635 transitions. Word has length 193 [2023-11-29 01:52:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:52:09,178 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 635 transitions. [2023-11-29 01:52:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 3.893617021276596) internal successors, (183), 47 states have internal predecessors, (183), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2023-11-29 01:52:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 635 transitions. [2023-11-29 01:52:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-29 01:52:09,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:52:09,181 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:52:09,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:52:09,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 01:52:09,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:52:09,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:52:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1836049331, now seen corresponding path program 1 times [2023-11-29 01:52:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:52:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472824250] [2023-11-29 01:52:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:52:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:52:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:52:09,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:52:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:52:09,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:52:09,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:52:09,629 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:52:09,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:52:09,635 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:52:09,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:52:09,731 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:52:09,732 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:52:09,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 01:52:09,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:52:09,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:52:09,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 01:52:09,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-29 01:52:09,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 01:52:09,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 01:52:09,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 01:52:09,735 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 01:52:09,736 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-29 01:52:09,736 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-29 01:52:09,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:52:09 BoogieIcfgContainer [2023-11-29 01:52:09,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:52:09,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:52:09,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:52:09,766 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:52:09,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:51:43" (3/4) ... [2023-11-29 01:52:09,769 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:52:09,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:52:09,770 INFO L158 Benchmark]: Toolchain (without parser) took 27495.63ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 113.3MB in the beginning and 294.8MB in the end (delta: -181.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,771 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:52:09,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.21ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 97.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.95ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 93.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,772 INFO L158 Benchmark]: Boogie Preprocessor took 86.51ms. Allocated memory is still 161.5MB. Free memory was 93.8MB in the beginning and 87.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,772 INFO L158 Benchmark]: RCFGBuilder took 659.32ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 126.1MB in the end (delta: -38.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,772 INFO L158 Benchmark]: TraceAbstraction took 26305.80ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 162.5MB in the beginning and 294.8MB in the end (delta: -132.3MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2023-11-29 01:52:09,773 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 408.9MB. Free memory is still 294.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:52:09,775 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.19ms. Allocated memory is still 161.5MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.21ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 97.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.95ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 93.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.51ms. Allocated memory is still 161.5MB. Free memory was 93.8MB in the beginning and 87.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 659.32ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 126.1MB in the end (delta: -38.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26305.80ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 162.5MB in the beginning and 294.8MB in the end (delta: -132.3MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 408.9MB. Free memory is still 294.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of bitwiseAnd at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_29 = 32; [L44] unsigned long int var_1_32 = 2219578776; [L45] unsigned char var_1_34 = 0; [L46] unsigned char var_1_35 = 0; [L47] unsigned char var_1_36 = 5; [L48] float var_1_37 = 256.125; [L49] float var_1_38 = 127.25; [L50] unsigned char var_1_41 = 32; [L51] double var_1_42 = 16.125; [L52] double var_1_43 = 256.5; [L53] signed short int var_1_45 = -10; [L54] unsigned char last_1_var_1_1 = 2; [L55] unsigned char last_1_var_1_15 = 1; [L56] signed char last_1_var_1_20 = 0; [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_1 = var_1_1 [L192] last_1_var_1_15 = var_1_15 [L193] last_1_var_1_20 = var_1_20 [L203] RET updateLastVariables() [L204] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] var_1_5 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L149] var_1_6 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=32, var_1_8=32, var_1_9=201/2] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_8=32, var_1_9=201/2] [L154] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L154] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=32, var_1_9=201/2] [L155] var_1_8 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L156] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_9=201/2] [L157] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L158] var_1_11 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L160] var_1_12 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L161] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L164] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L164] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L165] var_1_17 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L166] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L167] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L168] var_1_19 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L169] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L170] var_1_21 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L172] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L172] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L173] var_1_29 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L175] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L175] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L176] var_1_32 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L177] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L178] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L178] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L179] var_1_35 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L180] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L181] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L181] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L182] var_1_37 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L186] var_1_42 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L187] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L188] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L188] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L204] RET updateVariables() [L205] CALL step() [L60] COND FALSE !(var_1_5 >= var_1_6) [L69] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L71] unsigned char stepLocal_1 = var_1_15; [L72] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L73] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L74] COND TRUE var_1_15 && stepLocal_1 [L75] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] COND TRUE var_1_13 < ((((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)))) [L81] COND FALSE !(var_1_13 > var_1_1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] EXPR var_1_29 ^ var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] EXPR (var_1_29 ^ var_1_20) >> var_1_13 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] COND FALSE !(((var_1_29 ^ var_1_20) >> var_1_13) > ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) [L95] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L104] COND TRUE (var_1_38 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_37 [L105] var_1_41 = var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L107] COND TRUE var_1_11 == var_1_18 [L108] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L110] COND FALSE !(var_1_23 >= -25) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L113] COND TRUE (var_1_37 - var_1_38) >= (var_1_18 * var_1_22) [L114] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L116] COND FALSE !((((((var_1_22) < (var_1_37)) ? (var_1_22) : (var_1_37))) >= (var_1_38 / var_1_42)) || var_1_35) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_13 & var_1_24 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_20 ^ (var_1_13 & var_1_24) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] COND TRUE var_1_29 <= (var_1_20 ^ (var_1_13 & var_1_24)) [L122] COND FALSE !(\read(var_1_35)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L130] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=201/2] [L133] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L136] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=1, stepLocal_1=1, var_1_12=2219578781, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L138] var_1_22 = var_1_12 [L139] var_1_23 = var_1_8 [L140] var_1_24 = var_1_6 [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2219578781, var_1_23=0, var_1_24=127, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=127, var_1_7=64, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 13, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1858 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1842 mSDsluCounter, 4477 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2602 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2286 IncrementalHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 1875 mSDtfsCounter, 2286 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1604 GetRequests, 1478 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=11, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 487 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2846 NumberOfCodeBlocks, 2846 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3022 ConstructedInterpolants, 0 QuantifiedInterpolants, 20523 SizeOfPredicates, 18 NumberOfNonLiveVariables, 911 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 25135/25984 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 01:52:09,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:52:11,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:52:11,754 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:52:11,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:52:11,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:52:11,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:52:11,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:52:11,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:52:11,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:52:11,810 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:52:11,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:52:11,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:52:11,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:52:11,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:52:11,813 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:52:11,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:52:11,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:52:11,815 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:52:11,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:52:11,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:52:11,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:52:11,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:52:11,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:52:11,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:52:11,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:52:11,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:52:11,818 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:52:11,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:52:11,819 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:52:11,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:52:11,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:52:11,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:52:11,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:52:11,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:52:11,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:52:11,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:52:11,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:52:11,822 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:52:11,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:52:11,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:52:11,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:52:11,823 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:52:11,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:52:11,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:52:11,823 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:52:11,823 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2023-11-29 01:52:12,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:52:12,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:52:12,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:52:12,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:52:12,120 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:52:12,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:52:14,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:52:15,178 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:52:15,179 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:52:15,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/9af55f882/8afa949345704727b8fac6542912729c/FLAGcff98d74a [2023-11-29 01:52:15,204 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/data/9af55f882/8afa949345704727b8fac6542912729c [2023-11-29 01:52:15,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:52:15,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:52:15,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:52:15,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:52:15,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:52:15,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138a373b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15, skipping insertion in model container [2023-11-29 01:52:15,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,251 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:52:15,413 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2023-11-29 01:52:15,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:52:15,494 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:52:15,506 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_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2023-11-29 01:52:15,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:52:15,560 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:52:15,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15 WrapperNode [2023-11-29 01:52:15,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:52:15,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:52:15,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:52:15,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:52:15,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,615 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2023-11-29 01:52:15,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:52:15,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:52:15,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:52:15,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:52:15,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,650 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 01:52:15,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:52:15,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:52:15,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:52:15,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:52:15,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (1/1) ... [2023-11-29 01:52:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:52:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:52:15,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:52:15,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:52:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:52:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:52:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:52:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:52:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:52:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:52:15,836 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:52:15,838 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:52:45,608 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:52:45,668 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:52:45,668 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:52:45,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:52:45 BoogieIcfgContainer [2023-11-29 01:52:45,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:52:45,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:52:45,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:52:45,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:52:45,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:52:15" (1/3) ... [2023-11-29 01:52:45,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667ba034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:52:45, skipping insertion in model container [2023-11-29 01:52:45,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:52:15" (2/3) ... [2023-11-29 01:52:45,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667ba034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:52:45, skipping insertion in model container [2023-11-29 01:52:45,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:52:45" (3/3) ... [2023-11-29 01:52:45,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2023-11-29 01:52:45,697 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:52:45,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:52:45,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:52:45,753 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;@2f6e0c93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:52:45,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:52:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 01:52:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 01:52:45,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:52:45,777 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:52:45,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:52:45,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:52:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2101477047, now seen corresponding path program 1 times [2023-11-29 01:52:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:52:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831168525] [2023-11-29 01:52:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:52:45,799 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 01:52:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:52:45,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:45,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:52:47,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:52:47,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:52:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2023-11-29 01:52:47,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:52:47,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:52:47,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831168525] [2023-11-29 01:52:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831168525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:52:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:52:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:52:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997472321] [2023-11-29 01:52:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:52:47,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:52:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:52:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:52:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:52:47,775 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 01:52:49,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:52:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:52:49,895 INFO L93 Difference]: Finished difference Result 163 states and 301 transitions. [2023-11-29 01:52:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:52:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2023-11-29 01:52:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:52:49,930 INFO L225 Difference]: With dead ends: 163 [2023-11-29 01:52:49,930 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 01:52:49,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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 01:52:49,937 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:52:49,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:52:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 01:52:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-29 01:52:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 01:52:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 132 transitions. [2023-11-29 01:52:49,983 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 132 transitions. Word has length 181 [2023-11-29 01:52:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:52:49,984 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 132 transitions. [2023-11-29 01:52:49,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 01:52:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 132 transitions. [2023-11-29 01:52:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 01:52:49,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:52:49,989 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:52:50,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:50,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:52:50,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:52:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1732995839, now seen corresponding path program 1 times [2023-11-29 01:52:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:52:50,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735726462] [2023-11-29 01:52:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:52:50,193 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 01:52:50,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:52:50,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:50,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:52:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:52:52,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:52:52,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:52:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2023-11-29 01:52:53,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:52:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-11-29 01:52:54,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:52:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735726462] [2023-11-29 01:52:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735726462] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:52:54,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:52:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-11-29 01:52:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456634623] [2023-11-29 01:52:54,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:52:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:52:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:52:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:52:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:52:54,917 INFO L87 Difference]: Start difference. First operand 81 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-11-29 01:52:59,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:00,296 INFO L93 Difference]: Finished difference Result 192 states and 307 transitions. [2023-11-29 01:53:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:53:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 181 [2023-11-29 01:53:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:00,301 INFO L225 Difference]: With dead ends: 192 [2023-11-29 01:53:00,301 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 01:53:00,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:53:00,305 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 74 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:00,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 291 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 01:53:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 01:53:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2023-11-29 01:53:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 62 states have internal predecessors, (84), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 01:53:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2023-11-29 01:53:00,331 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 181 [2023-11-29 01:53:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:00,332 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2023-11-29 01:53:00,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-11-29 01:53:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2023-11-29 01:53:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 01:53:00,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:00,338 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:00,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:00,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:00,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:00,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1357088293, now seen corresponding path program 1 times [2023-11-29 01:53:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399567153] [2023-11-29 01:53:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:00,540 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 01:53:00,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:00,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:00,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:02,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:53:02,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:53:08,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:08,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399567153] [2023-11-29 01:53:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399567153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:08,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:08,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:53:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013333079] [2023-11-29 01:53:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:08,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:53:08,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:08,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:53:08,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:53:08,150 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:11,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:11,510 INFO L93 Difference]: Finished difference Result 274 states and 434 transitions. [2023-11-29 01:53:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:53:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2023-11-29 01:53:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:11,517 INFO L225 Difference]: With dead ends: 274 [2023-11-29 01:53:11,517 INFO L226 Difference]: Without dead ends: 190 [2023-11-29 01:53:11,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 180 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 01:53:11,520 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 38 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:11,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 254 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 01:53:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-29 01:53:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2023-11-29 01:53:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 01:53:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 294 transitions. [2023-11-29 01:53:11,564 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 294 transitions. Word has length 182 [2023-11-29 01:53:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:11,565 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 294 transitions. [2023-11-29 01:53:11,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 294 transitions. [2023-11-29 01:53:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 01:53:11,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:11,569 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:11,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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)] Forceful destruction successful, exit code 0 [2023-11-29 01:53:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:11,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:11,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1284372992, now seen corresponding path program 1 times [2023-11-29 01:53:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275568982] [2023-11-29 01:53:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:11,772 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 01:53:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:11,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:11,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:13,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:53:13,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:53:16,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:16,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275568982] [2023-11-29 01:53:16,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275568982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:16,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:53:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406419502] [2023-11-29 01:53:16,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:16,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:53:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:53:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:53:16,091 INFO L87 Difference]: Start difference. First operand 187 states and 294 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:18,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:20,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:20,073 INFO L93 Difference]: Finished difference Result 420 states and 661 transitions. [2023-11-29 01:53:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:53:20,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2023-11-29 01:53:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:20,078 INFO L225 Difference]: With dead ends: 420 [2023-11-29 01:53:20,078 INFO L226 Difference]: Without dead ends: 256 [2023-11-29 01:53:20,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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 01:53:20,080 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 30 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:20,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 01:53:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-29 01:53:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-11-29 01:53:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2023-11-29 01:53:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2023-11-29 01:53:20,131 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 183 [2023-11-29 01:53:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:20,132 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2023-11-29 01:53:20,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2023-11-29 01:53:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 01:53:20,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:20,136 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:20,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:20,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:20,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:20,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1964431362, now seen corresponding path program 1 times [2023-11-29 01:53:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493355011] [2023-11-29 01:53:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:20,338 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 01:53:20,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:20,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:20,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:22,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:53:22,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-11-29 01:53:24,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:24,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493355011] [2023-11-29 01:53:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493355011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:53:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924920786] [2023-11-29 01:53:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:24,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:53:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:53:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:53:24,956 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:27,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:29,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:53:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:30,100 INFO L93 Difference]: Finished difference Result 407 states and 636 transitions. [2023-11-29 01:53:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:53:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2023-11-29 01:53:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:30,105 INFO L225 Difference]: With dead ends: 407 [2023-11-29 01:53:30,105 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 01:53:30,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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 01:53:30,107 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:30,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 01:53:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 01:53:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2023-11-29 01:53:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 195 states have (on average 1.358974358974359) internal successors, (265), 195 states have internal predecessors, (265), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2023-11-29 01:53:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 497 transitions. [2023-11-29 01:53:30,156 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 497 transitions. Word has length 183 [2023-11-29 01:53:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:30,157 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 497 transitions. [2023-11-29 01:53:30,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-11-29 01:53:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 497 transitions. [2023-11-29 01:53:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 01:53:30,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:30,161 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:30,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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)] Ended with exit code 0 [2023-11-29 01:53:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:30,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1966278404, now seen corresponding path program 1 times [2023-11-29 01:53:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909302401] [2023-11-29 01:53:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:30,363 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 01:53:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:30,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:30,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/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 01:53:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:32,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:53:32,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:54:06,243 WARN L293 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:54:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 788 proven. 102 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-11-29 01:54:12,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:54:56,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:54:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909302401] [2023-11-29 01:54:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909302401] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:54:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [300776114] [2023-11-29 01:54:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:54:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:54:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:54:56,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:54:56,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fa20712-a5fc-4719-a3a9-c68a89bd5ef4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-11-29 01:55:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:01,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:55:01,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 788 proven. 102 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-11-29 01:55:31,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:55:56,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [300776114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:55:56,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:55:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 01:55:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074903253] [2023-11-29 01:55:56,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:55:56,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:55:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:55:56,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:55:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2023-11-29 01:55:56,453 INFO L87 Difference]: Start difference. First operand 320 states and 497 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-29 01:56:35,453 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 40 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:56:41,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:56:45,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:56:49,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:56:53,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:56:57,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:03,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:07,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:11,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:15,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:19,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:21,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:26,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:30,957 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 01:57:34,968 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 01:57:38,975 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 01:57:42,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:57:48,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:57:52,046 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 01:57:56,061 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 01:58:00,074 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 01:58:04,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:08,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:58:13,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:17,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:21,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:25,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:29,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:33,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:37,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:41,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:45,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:49,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:55,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:58:59,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:03,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:07,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:11,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:17,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:21,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:25,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:29,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:33,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:37,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:59:41,873 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 01:59:45,885 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 01:59:49,888 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 01:59:53,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:59:57,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:01,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:05,553 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:00:09,556 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:00:13,560 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:00:17,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:00:19,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:00:25,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:29,123 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:00:33,140 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:00:37,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:41,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:00:45,227 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:00:51,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:55,164 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:00:59,170 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:01:03,182 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:01:07,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:11,210 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:01:12,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:15,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:20,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:24,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:28,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:32,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:36,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:39,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:01:43,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:44,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:47,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:01:50,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:02:14,674 WARN L293 SmtUtils]: Spent 19.46s on a formula simplification. DAG size of input: 43 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:02:16,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:02:40,389 WARN L293 SmtUtils]: Spent 22.38s on a formula simplification. DAG size of input: 46 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:02:44,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:02:48,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:02:51,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:02:55,688 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 [0] [2023-11-29 02:02:58,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:03,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:06,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:27,467 WARN L293 SmtUtils]: Spent 15.56s on a formula simplification. DAG size of input: 44 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:03:29,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:32,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:36,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:40,293 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 [0] [2023-11-29 02:03:44,297 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 [0] [2023-11-29 02:03:45,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:49,895 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 [0] [2023-11-29 02:03:52,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:03:57,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:01,648 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 [0] [2023-11-29 02:04:03,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:07,822 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 [0] [2023-11-29 02:04:10,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:12,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:16,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:20,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:22,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:23,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:27,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:31,551 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 [0] [2023-11-29 02:04:35,556 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 [0] [2023-11-29 02:04:38,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:40,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:42,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:44,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:48,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:52,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:04:56,730 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 [0] [2023-11-29 02:05:00,734 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 [0] [2023-11-29 02:05:04,748 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 [0] [2023-11-29 02:05:06,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:11,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:15,471 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 [0] [2023-11-29 02:05:19,475 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 [0] [2023-11-29 02:05:23,478 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 [0] [2023-11-29 02:05:27,509 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 [0] [2023-11-29 02:05:28,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:30,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:34,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:38,508 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 [0] [2023-11-29 02:05:42,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:45,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:49,134 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 [0] [2023-11-29 02:05:50,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:52,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:05:56,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:06:00,199 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 [0] [2023-11-29 02:06:04,202 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 [0] [2023-11-29 02:06:05,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:06:08,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]