./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/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 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:36:38,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:36:38,129 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:36:38,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:36:38,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:36:38,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:36:38,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:36:38,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:36:38,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:36:38,164 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:36:38,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:36:38,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:36:38,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:36:38,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:36:38,167 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:36:38,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:36:38,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:36:38,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:36:38,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:36:38,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:36:38,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:36:38,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:36:38,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:36:38,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:36:38,173 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:36:38,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:36:38,174 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:36:38,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:36:38,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:36:38,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:36:38,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:36:38,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:36:38,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:36:38,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:36:38,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:36:38,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:36:38,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:36:38,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:36:38,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:36:38,188 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:36:38,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:36:38,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:36:38,189 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_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/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 -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2023-11-29 05:36:38,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:36:38,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:36:38,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:36:38,446 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:36:38,446 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:36:38,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:41,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:36:41,495 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:36:41,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:41,506 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/e2644d34c/72c5a2e3935a45db822cc5c1a0d3312f/FLAGc2c075d3f [2023-11-29 05:36:41,522 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/e2644d34c/72c5a2e3935a45db822cc5c1a0d3312f [2023-11-29 05:36:41,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:36:41,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:36:41,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:36:41,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:36:41,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:36:41,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f82e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41, skipping insertion in model container [2023-11-29 05:36:41,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:36:41,734 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-29 05:36:41,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:36:41,790 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:36:41,805 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_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-29 05:36:41,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:36:41,844 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:36:41,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41 WrapperNode [2023-11-29 05:36:41,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:36:41,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:36:41,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:36:41,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:36:41,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,895 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2023-11-29 05:36:41,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:36:41,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:36:41,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:36:41,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:36:41,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,927 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 05:36:41,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:36:41,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:36:41,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:36:41,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:36:41,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (1/1) ... [2023-11-29 05:36:41,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:36:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:41,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:36:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:36:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:36:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:36:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:36:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:36:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:36:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:36:42,123 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:36:42,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:36:42,408 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:36:42,442 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:36:42,442 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:36:42,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:42 BoogieIcfgContainer [2023-11-29 05:36:42,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:36:42,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:36:42,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:36:42,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:36:42,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:36:41" (1/3) ... [2023-11-29 05:36:42,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114d25e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:36:42, skipping insertion in model container [2023-11-29 05:36:42,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:41" (2/3) ... [2023-11-29 05:36:42,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114d25e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:36:42, skipping insertion in model container [2023-11-29 05:36:42,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:42" (3/3) ... [2023-11-29 05:36:42,453 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:42,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:36:42,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:36:42,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:36:42,528 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;@6ccb8b1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:36:42,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:36:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:36:42,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:42,548 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:42,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:42,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash -266298122, now seen corresponding path program 1 times [2023-11-29 05:36:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174800861] [2023-11-29 05:36:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:42,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:36:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:36:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:36:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:36:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:36:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:36:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:36:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:36:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:36:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:36:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:36:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:36:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:36:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:36:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:36:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:36:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-29 05:36:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:42,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174800861] [2023-11-29 05:36:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174800861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:36:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135837506] [2023-11-29 05:36:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:42,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:36:42,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:36:42,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:36:42,960 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:36:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:43,003 INFO L93 Difference]: Finished difference Result 105 states and 181 transitions. [2023-11-29 05:36:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:36:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2023-11-29 05:36:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:43,014 INFO L225 Difference]: With dead ends: 105 [2023-11-29 05:36:43,014 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 05:36:43,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 05:36:43,022 INFO L413 NwaCegarLoop]: 75 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, 75 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 05:36:43,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:36:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 05:36:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-29 05:36:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2023-11-29 05:36:43,066 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 105 [2023-11-29 05:36:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:43,067 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2023-11-29 05:36:43,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:36:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2023-11-29 05:36:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:36:43,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:43,071 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:43,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:36:43,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:43,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash 412453368, now seen corresponding path program 1 times [2023-11-29 05:36:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:43,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541517932] [2023-11-29 05:36:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:36:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:36:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:36:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:36:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:36:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:36:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:36:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:36:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:36:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:36:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:36:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:36:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:36:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:36:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:36:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:36:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-29 05:36:43,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541517932] [2023-11-29 05:36:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541517932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:36:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898766924] [2023-11-29 05:36:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:43,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:36:43,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:36:43,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:36:43,861 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:36:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:44,376 INFO L93 Difference]: Finished difference Result 184 states and 277 transitions. [2023-11-29 05:36:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:36:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-29 05:36:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:44,381 INFO L225 Difference]: With dead ends: 184 [2023-11-29 05:36:44,381 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 05:36:44,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:36:44,384 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 155 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:44,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 421 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:36:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 05:36:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2023-11-29 05:36:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2023-11-29 05:36:44,404 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 105 [2023-11-29 05:36:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:44,406 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2023-11-29 05:36:44,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:36:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2023-11-29 05:36:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:36:44,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:44,409 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:44,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:36:44,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:44,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 283165112, now seen corresponding path program 1 times [2023-11-29 05:36:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806352590] [2023-11-29 05:36:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:36:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:36:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:36:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:36:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:36:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:36:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:36:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:36:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:36:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:36:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:36:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:36:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:36:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:36:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:36:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:36:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-29 05:36:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806352590] [2023-11-29 05:36:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806352590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:36:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42425839] [2023-11-29 05:36:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:36:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:36:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:36:44,714 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:36:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:44,799 INFO L93 Difference]: Finished difference Result 161 states and 240 transitions. [2023-11-29 05:36:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:36:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-29 05:36:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:44,803 INFO L225 Difference]: With dead ends: 161 [2023-11-29 05:36:44,803 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 05:36:44,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:36:44,805 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:44,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 465 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:36:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 05:36:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2023-11-29 05:36:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2023-11-29 05:36:44,819 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 105 [2023-11-29 05:36:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:44,820 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2023-11-29 05:36:44,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:36:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2023-11-29 05:36:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:36:44,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:44,823 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:44,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:36:44,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:44,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 503678509, now seen corresponding path program 1 times [2023-11-29 05:36:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:44,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179300633] [2023-11-29 05:36:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:36:44,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:36:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:36:44,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:36:44,988 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:36:44,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:36:44,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:36:44,995 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 05:36:44,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:36:45,061 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 05:36:45,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 05:36:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:36:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 05:36:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:36:45,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:36:45 BoogieIcfgContainer [2023-11-29 05:36:45,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:36:45,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:36:45,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:36:45,082 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:36:45,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:42" (3/4) ... [2023-11-29 05:36:45,084 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:36:45,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:36:45,086 INFO L158 Benchmark]: Toolchain (without parser) took 3560.71ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 108.5MB in the beginning and 112.4MB in the end (delta: -3.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2023-11-29 05:36:45,086 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:36:45,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.78ms. Allocated memory is still 146.8MB. Free memory was 108.5MB in the beginning and 95.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:36:45,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 146.8MB. Free memory was 95.3MB in the beginning and 92.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:36:45,088 INFO L158 Benchmark]: Boogie Preprocessor took 46.18ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:36:45,088 INFO L158 Benchmark]: RCFGBuilder took 499.22ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 72.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:36:45,088 INFO L158 Benchmark]: TraceAbstraction took 2635.45ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 72.4MB in the beginning and 112.4MB in the end (delta: -40.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:36:45,089 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 180.4MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:36:45,091 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.21ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.78ms. Allocated memory is still 146.8MB. Free memory was 108.5MB in the beginning and 95.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 146.8MB. Free memory was 95.3MB in the beginning and 92.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.18ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.22ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 72.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2635.45ms. Allocated memory was 146.8MB in the beginning and 180.4MB in the end (delta: 33.6MB). Free memory was 72.4MB in the beginning and 112.4MB in the end (delta: -40.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 180.4MB. Free memory is still 112.4MB. 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~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 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 someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L105] RET updateVariables() [L106] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967295, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=4294967295, var_1_8=0] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967295, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=1, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=0, var_1_7=4294967295, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 961 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 627 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 334 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 122 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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 05:36:45,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/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 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:36:47,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:36:47,264 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:36:47,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:36:47,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:36:47,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:36:47,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:36:47,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:36:47,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:36:47,320 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:36:47,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:36:47,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:36:47,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:36:47,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:36:47,323 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:36:47,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:36:47,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:36:47,325 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:36:47,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:36:47,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:36:47,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:36:47,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:36:47,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:36:47,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:36:47,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:36:47,329 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:36:47,330 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:36:47,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:36:47,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:36:47,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:36:47,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:36:47,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:36:47,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:36:47,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:36:47,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:36:47,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:36:47,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:36:47,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:36:47,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:36:47,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:36:47,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:36:47,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:36:47,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:36:47,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:36:47,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:36:47,336 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_0e138e5e-042d-4971-9bca-879f37ee2b50/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_0e138e5e-042d-4971-9bca-879f37ee2b50/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 -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2023-11-29 05:36:47,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:36:47,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:36:47,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:36:47,725 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:36:47,725 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:36:47,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:50,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:36:50,858 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:36:50,859 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:50,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/1de24bdc1/1ed0eece2ca74e9abe879234f5c17000/FLAG676796495 [2023-11-29 05:36:50,884 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/data/1de24bdc1/1ed0eece2ca74e9abe879234f5c17000 [2023-11-29 05:36:50,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:36:50,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:36:50,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:36:50,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:36:50,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:36:50,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:36:50" (1/1) ... [2023-11-29 05:36:50,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4885dd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:50, skipping insertion in model container [2023-11-29 05:36:50,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:36:50" (1/1) ... [2023-11-29 05:36:50,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:36:51,069 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_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-29 05:36:51,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:36:51,134 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:36:51,147 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_0e138e5e-042d-4971-9bca-879f37ee2b50/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2023-11-29 05:36:51,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:36:51,191 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:36:51,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51 WrapperNode [2023-11-29 05:36:51,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:36:51,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:36:51,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:36:51,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:36:51,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,240 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-11-29 05:36:51,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:36:51,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:36:51,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:36:51,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:36:51,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,273 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 05:36:51,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:36:51,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:36:51,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:36:51,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:36:51,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (1/1) ... [2023-11-29 05:36:51,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:36:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:51,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:36:51,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:36:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:36:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:36:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:36:51,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:36:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:36:51,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:36:51,491 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:36:51,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:36:51,713 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:36:51,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:36:51,774 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:36:51,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:51 BoogieIcfgContainer [2023-11-29 05:36:51,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:36:51,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:36:51,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:36:51,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:36:51,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:36:50" (1/3) ... [2023-11-29 05:36:51,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c92ac30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:36:51, skipping insertion in model container [2023-11-29 05:36:51,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:36:51" (2/3) ... [2023-11-29 05:36:51,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c92ac30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:36:51, skipping insertion in model container [2023-11-29 05:36:51,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:51" (3/3) ... [2023-11-29 05:36:51,785 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2023-11-29 05:36:51,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:36:51,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:36:51,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:36:51,872 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;@38ccf27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:36:51,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:36:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:36:51,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:51,892 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:51,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:51,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1197207762, now seen corresponding path program 1 times [2023-11-29 05:36:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:36:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462072769] [2023-11-29 05:36:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:51,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:36:51,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:36:51,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:51,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:52,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:36:52,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-29 05:36:52,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:36:52,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:36:52,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462072769] [2023-11-29 05:36:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462072769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:36:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:36:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:36:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049893776] [2023-11-29 05:36:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:36:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:36:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:36:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:36:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:36:52,235 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:36:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:52,282 INFO L93 Difference]: Finished difference Result 87 states and 153 transitions. [2023-11-29 05:36:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:36:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2023-11-29 05:36:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:52,293 INFO L225 Difference]: With dead ends: 87 [2023-11-29 05:36:52,293 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 05:36:52,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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 05:36:52,300 INFO L413 NwaCegarLoop]: 61 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, 61 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 05:36:52,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:36:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 05:36:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-29 05:36:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:36:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-11-29 05:36:52,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 103 [2023-11-29 05:36:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:52,346 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-11-29 05:36:52,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:36:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-11-29 05:36:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:36:52,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:52,350 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:52,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:52,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:52,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1966328236, now seen corresponding path program 1 times [2023-11-29 05:36:52,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:36:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852277796] [2023-11-29 05:36:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:52,555 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 05:36:52,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:36:52,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:52,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:36:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:52,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:36:52,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:37:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 382 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 05:37:01,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:37:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 05:37:12,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:37:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852277796] [2023-11-29 05:37:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852277796] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:37:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:37:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [30] total 40 [2023-11-29 05:37:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122944817] [2023-11-29 05:37:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:37:12,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:37:12,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:37:12,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:37:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 05:37:12,793 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:37:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:37:17,245 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2023-11-29 05:37:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:37:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2023-11-29 05:37:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:37:17,249 INFO L225 Difference]: With dead ends: 79 [2023-11-29 05:37:17,249 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 05:37:17,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 05:37:17,251 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 115 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:37:17,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 202 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 05:37:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 05:37:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-29 05:37:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 05:37:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2023-11-29 05:37:17,271 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2023-11-29 05:37:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:37:17,272 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2023-11-29 05:37:17,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:37:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2023-11-29 05:37:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:37:17,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:37:17,275 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:17,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:17,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:17,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:37:17,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:37:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash -191320874, now seen corresponding path program 1 times [2023-11-29 05:37:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:37:17,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189696854] [2023-11-29 05:37:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:37:17,478 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 05:37:17,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:37:17,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:17,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:17,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:37:17,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:37:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 05:37:17,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:37:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 05:37:17,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:37:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189696854] [2023-11-29 05:37:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189696854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:37:17,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:37:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-29 05:37:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769308757] [2023-11-29 05:37:17,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:37:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:37:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:37:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:37:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:37:17,809 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:37:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:37:18,507 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2023-11-29 05:37:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:37:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 103 [2023-11-29 05:37:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:37:18,511 INFO L225 Difference]: With dead ends: 162 [2023-11-29 05:37:18,511 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:37:18,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:37:18,513 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:37:18,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 193 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:37:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:37:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-11-29 05:37:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-29 05:37:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2023-11-29 05:37:18,536 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 103 [2023-11-29 05:37:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:37:18,536 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2023-11-29 05:37:18,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:37:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2023-11-29 05:37:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:37:18,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:37:18,538 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:18,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:37:18,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:18,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:37:18,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:37:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -841647817, now seen corresponding path program 1 times [2023-11-29 05:37:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:37:18,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918180393] [2023-11-29 05:37:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:37:18,741 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 05:37:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:37:18,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:18,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:18,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 05:37:18,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:37:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 05:37:28,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:37:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 05:37:40,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:37:40,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918180393] [2023-11-29 05:37:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918180393] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:37:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:37:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-11-29 05:37:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532169332] [2023-11-29 05:37:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:37:40,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:37:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:37:40,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:37:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 05:37:40,406 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:37:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:37:44,137 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2023-11-29 05:37:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:37:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2023-11-29 05:37:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:37:44,142 INFO L225 Difference]: With dead ends: 106 [2023-11-29 05:37:44,142 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 05:37:44,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=398, Invalid=1954, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:37:44,145 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:37:44,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 224 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 05:37:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 05:37:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2023-11-29 05:37:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 05:37:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-11-29 05:37:44,171 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 104 [2023-11-29 05:37:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:37:44,171 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-11-29 05:37:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:37:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-11-29 05:37:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:37:44,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:37:44,175 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:44,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:37:44,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:44,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:37:44,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:37:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash -330901025, now seen corresponding path program 1 times [2023-11-29 05:37:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:37:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951615050] [2023-11-29 05:37:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:37:44,377 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 05:37:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:37:44,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:44,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:37:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:44,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 05:37:44,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:37:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 05:37:53,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 05:38:06,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:38:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951615050] [2023-11-29 05:38:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951615050] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [35] total 47 [2023-11-29 05:38:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674395512] [2023-11-29 05:38:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:06,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:38:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:38:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:38:06,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 05:38:06,423 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:38:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:16,749 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2023-11-29 05:38:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:38:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-29 05:38:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:16,753 INFO L225 Difference]: With dead ends: 100 [2023-11-29 05:38:16,753 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:38:16,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2023-11-29 05:38:16,757 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 71 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:16,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 144 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 05:38:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:38:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-11-29 05:38:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 54 states have internal predecessors, (56), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 05:38:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2023-11-29 05:38:16,788 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 105 [2023-11-29 05:38:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:16,789 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2023-11-29 05:38:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:38:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2023-11-29 05:38:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:38:16,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:16,792 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:16,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:38:16,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:38:16,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:38:16,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -330841443, now seen corresponding path program 1 times [2023-11-29 05:38:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:38:16,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156716795] [2023-11-29 05:38:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:16,994 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 05:38:16,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:38:16,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:38:16,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:38:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:17,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 05:38:17,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 05:38:27,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 05:38:43,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:38:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156716795] [2023-11-29 05:38:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156716795] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:38:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2023-11-29 05:38:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221726064] [2023-11-29 05:38:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:38:43,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:38:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:38:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:38:43,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 05:38:43,912 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:38:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:51,835 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2023-11-29 05:38:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:38:51,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-29 05:38:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:51,837 INFO L225 Difference]: With dead ends: 97 [2023-11-29 05:38:51,837 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:38:51,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=409, Invalid=1943, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:38:51,840 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:51,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 160 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 05:38:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:38:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:38:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:38:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:38:51,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2023-11-29 05:38:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:51,842 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:38:51,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 05:38:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:38:51,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:38:51,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:38:51,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:38:52,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 05:38:52,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:39:00,883 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 265 DAG size of output: 76 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 05:39:02,327 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-11-29 05:39:02,327 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,327 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,327 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-29 05:39:02,328 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 05:39:02,328 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 05:39:02,328 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 05:39:02,328 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 05:39:02,328 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,328 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 05:39:02,329 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-11-29 05:39:02,329 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-29 05:39:02,329 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,329 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,329 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 47) no Hoare annotation was computed. [2023-11-29 05:39:02,329 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 05:39:02,329 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,330 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,331 INFO L895 garLoopResultBuilder]: At program point L103-2(lines 103 109) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ~var_1_16~0)) (.cse4 ((_ zero_extend 24) ~var_1_15~0))) (let ((.cse3 (bvsle .cse4 (_ bv1 32))) (.cse0 (= .cse10 .cse4)) (.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvadd ((_ sign_extend 24) ~var_1_12~0) ((_ sign_extend 24) ~var_1_13~0) (_ bv4294967246 32) ((_ sign_extend 24) ~var_1_14~0))))) (.cse6 ((_ sign_extend 24) ~var_1_11~0))) (or (let ((.cse1 (forall ((v_subst_6 (_ BitVec 32)) (v_subst_5 (_ BitVec 32))) (or (not (bvuge (bvadd v_subst_6 (bvneg ~var_1_8~0)) v_subst_5)) (not (bvult .cse5 (bvlshr ~var_1_8~0 v_subst_5))))))) (and (or .cse0 .cse1) (fp.eq ~var_1_18~0 ~var_1_18~0) (or .cse1 .cse2) (not (bvult |ULTIMATE.start_step_~stepLocal_1~0#1| (bvlshr ~var_1_8~0 ~var_1_9~0))) .cse3 (bvsge .cse4 (_ bv1 32)) (or (and .cse0 .cse2) (not (= .cse5 ~last_1_var_1_6~0))) (or (= ~last_1_var_1_6~0 .cse6) (forall ((v_subst_4 (_ BitVec 32))) (not (bvult .cse6 (bvlshr ~var_1_8~0 v_subst_4))))))) (let ((.cse11 (bvmul (_ bv2 32) .cse6))) (let ((.cse7 (bvslt .cse11 .cse6)) (.cse8 ((_ sign_extend 16) ~var_1_1~0)) (.cse9 (= .cse5 .cse6))) (and (or .cse7 (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse6)) .cse8) .cse0 .cse2 .cse9)) .cse3 (bvsge .cse10 (_ bv1 32)) (or (not .cse7) (and .cse0 (= ((_ sign_extend 16) ((_ extract 15 0) .cse11)) .cse8) .cse2 .cse9)))))))) [2023-11-29 05:39:02,331 INFO L899 garLoopResultBuilder]: For program point L103-3(lines 103 109) no Hoare annotation was computed. [2023-11-29 05:39:02,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:39:02,331 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse1 ((_ zero_extend 24) ~var_1_15~0)) (.cse0 ((_ zero_extend 24) ~var_1_16~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,331 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 65 92) no Hoare annotation was computed. [2023-11-29 05:39:02,331 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-29 05:39:02,332 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,332 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,332 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 44) no Hoare annotation was computed. [2023-11-29 05:39:02,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:39:02,332 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 39 64) no Hoare annotation was computed. [2023-11-29 05:39:02,332 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 05:39:02,333 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,333 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,333 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,333 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (bvsge ((_ zero_extend 24) ~var_1_16~0) (_ bv1 32)))) [2023-11-29 05:39:02,333 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 63) no Hoare annotation was computed. [2023-11-29 05:39:02,333 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 05:39:02,334 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,334 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_15~0))) (and (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)))) [2023-11-29 05:39:02,334 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 64) no Hoare annotation was computed. [2023-11-29 05:39:02,334 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 05:39:02,334 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 05:39:02,334 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 05:39:02,334 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 05:39:02,335 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 05:39:02,338 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 05:39:02,340 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:39:02,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_5))) could not be translated [2023-11-29 05:39:02,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-11-29 05:39:02,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_5))) could not be translated [2023-11-29 05:39:02,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-11-29 05:39:02,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~stepLocal_1~0 [2023-11-29 05:39:02,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-11-29 05:39:02,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_4))) could not be translated [2023-11-29 05:39:02,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-11-29 05:39:02,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2023-11-29 05:39:02,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:39:02 BoogieIcfgContainer [2023-11-29 05:39:02,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:39:02,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:39:02,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:39:02,358 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:39:02,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:36:51" (3/4) ... [2023-11-29 05:39:02,361 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:39:02,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 05:39:02,372 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 05:39:02,372 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 05:39:02,373 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:39:02,373 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:39:02,470 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:39:02,470 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:39:02,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:39:02,471 INFO L158 Benchmark]: Toolchain (without parser) took 131582.21ms. Allocated memory was 98.6MB in the beginning and 994.1MB in the end (delta: 895.5MB). Free memory was 75.2MB in the beginning and 766.8MB in the end (delta: -691.6MB). Peak memory consumption was 204.6MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,472 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:39:02,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.32ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 62.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,473 INFO L158 Benchmark]: Boogie Preprocessor took 58.63ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,474 INFO L158 Benchmark]: RCFGBuilder took 473.44ms. Allocated memory is still 98.6MB. Free memory was 57.5MB in the beginning and 61.6MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,474 INFO L158 Benchmark]: TraceAbstraction took 130579.85ms. Allocated memory was 98.6MB in the beginning and 994.1MB in the end (delta: 895.5MB). Free memory was 60.8MB in the beginning and 772.0MB in the end (delta: -711.2MB). Peak memory consumption was 588.4MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,475 INFO L158 Benchmark]: Witness Printer took 112.96ms. Allocated memory is still 994.1MB. Free memory was 772.0MB in the beginning and 766.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:39:02,477 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.27ms. Allocated memory is still 65.0MB. Free memory is still 41.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.32ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 62.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.63ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.44ms. Allocated memory is still 98.6MB. Free memory was 57.5MB in the beginning and 61.6MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 130579.85ms. Allocated memory was 98.6MB in the beginning and 994.1MB in the end (delta: 895.5MB). Free memory was 60.8MB in the beginning and 772.0MB in the end (delta: -711.2MB). Peak memory consumption was 588.4MB. Max. memory is 16.1GB. * Witness Printer took 112.96ms. Allocated memory is still 994.1MB. Free memory was 772.0MB in the beginning and 766.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_5))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_6 : bv32, v_subst_5 : bv32 :: !~bvuge~32(~bvadd~32(v_subst_6, ~bvneg~32(~var_1_8~0)), v_subst_5) || !~bvult~32(~sign_extend~32~16(~bvadd~32(~sign_extend~32~16(~var_1_12~0), ~sign_extend~32~16(~var_1_13~0), 4294967246bv32, ~sign_extend~32~16(~var_1_14~0))[7:0]), ~bvlshr~32(~var_1_8~0, v_subst_5))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~stepLocal_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: !~bvult~32(~sign_extend~32~16(~var_1_11~0), ~bvlshr~32(~var_1_8~0, v_subst_4))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.5s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 603 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1652 IncrementalHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 381 mSDtfsCounter, 1652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1172 GetRequests, 958 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 93 PreInvPairs, 130 NumberOfFragments, 413 HoareAnnotationTreeSize, 93 FomulaSimplifications, 6729 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 23753 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 90.6s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1132 ConstructedInterpolants, 31 QuantifiedInterpolants, 15750 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 5774/5984 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((var_1_15 <= 1) && (var_1_15 >= 1)) && ((var_1_16 == var_1_15) || !(((((var_1_12 + var_1_13) % 4294967296) & 127) == last_1_var_1_6)))) || ((((((2 * var_1_11) < var_1_11) || ((((var_1_11 & 32767) == var_1_1) && (var_1_16 == var_1_15)) && ((((var_1_12 + var_1_13) % 4294967296) & 127) == var_1_11))) && (var_1_15 <= 1)) && (var_1_16 >= 1)) && (!(((2 * var_1_11) < var_1_11)) || (((var_1_16 == var_1_15) && (((2 * var_1_11) & 32767) == var_1_1)) && ((((var_1_12 + var_1_13) % 4294967296) & 127) == var_1_11))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 05:39:02,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e138e5e-042d-4971-9bca-879f37ee2b50/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 Writing output log to file Ultimate.log Result: TRUE